What problem does it solve? Designing multi-core partitioning and UB (Unified Buffer) slicing for Ascend C kernels is error-prone: developers must choose the right algorithm per operator family, compute UB budgets against hardware limits, and handle alignment, dtype, and boundary cases correctly. ## Core Features & Use Cases - Scenario Routing: Decision trees route Reduction (AR/ARA, FullLoad/Split), Elementwise, and Broadcast operators to the correct tiling strategy based on shape, axes, and chip (DAV_2201 vs DAV_3510). - Algorithm Library: Covers Welford online statistics, Group Reduce cross-core reduction, dichotomy summation for precision, and index-tracking ArgMax/ArgMin variants. - UB Budget Formulas: Provides concrete buffer equations, tmpBufSize computation, multi-core split parameters, and tiling struct field conventions. - Use Case: When implementing a LayerNorm or Softmax kernel on Ascend 910B, use this Skill to decide between AR-FullLoad and AR-ColSplit, compute chunk sizes, and plan double-buffered queues. ## Quick Start Ask the assistant to design the tiling plan for a ReduceSum kernel with shape [A1, R] on Ascend 910B, including multi-core split and UB buffer allocation.