A large dimensional matrix chain matrix multiplier for extremely low IO bandwidth requirements
Large-dimensional matrix multiplication is often implemented by submatrix block method. The maximum size of the submatrix determines the speed of the entire matrix multiplication. Concerning the problem that the matrix size directly processed by the classical systolic structure is severely limited b...
Main Authors: | Song Yukun, Zheng Qiangqiang, Wang Zezhong, Zhang Duoli |
---|---|
Format: | Article |
Language: | zho |
Published: |
National Computer System Engineering Research Institute of China
2019-09-01
|
Series: | Dianzi Jishu Yingyong |
Subjects: | |
Online Access: | http://www.chinaaet.com/article/3000108356 |
Similar Items
-
The Bandwidths of a Matrix. A Survey of Algorithms
by: Mafteiu-Scai Liviu Octavian
Published: (2014-12-01) -
Selection of the Bandwidth Matrix in Spatial Varying Coefficient Models to Detect Anisotropic Regression Relationships
by: Xijian Hu, et al.
Published: (2021-09-01) -
Miniature Patch and Slot Microstrip Arrays for IoT and ISM Band Applications
by: Karen N. Olan-Nunez, et al.
Published: (2020-01-01) -
Design of Linear Systolic Arrays for Matrix Multiplication
by: MILOVANOVIC, E. I., et al.
Published: (2014-02-01) -
Bandwidth Aggregation Across Multiple Smartphone Devices
by: Zeller, Bradley R
Published: (2014)