An adaptive MatMul framework for Ascend NPUs selects optimal tiling and instruction schedules via an analytical model, delivering 1.85x mean speedup over the vendor library on 80,000 dynamic shapes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Adaptive Matrix Multiplication for Dynamic Shapes on Ascend NPUs
An adaptive MatMul framework for Ascend NPUs selects optimal tiling and instruction schedules via an analytical model, delivering 1.85x mean speedup over the vendor library on 80,000 dynamic shapes.