Topic summary
Dense matrix
Extracted from the Wikipedia article Sparse matrix.
Notes
- ^ 3. doi:10.1109/icct.2017.8359956. ISBN .
The computation kernel of DNN is large sparse-dense matrix multiplication. In the field of numerical analysis, a sparse matrix is a matrix populated primarily with zeros as elements of the table. By contrast, if the number of non-zero elements in a matrix is relatively large, then it is commonly considered a dense matrix. The fraction of zero elements (non-zero elements) in a matrix is called the sparsity (density). Operations using standard dense-matrix structures and algorithms are relatively slow and consume large amounts of memory when applied to large sparse matrices.
- ^.
The WSE contains 400,000 AI-optimized compute cores. Called SLAC™ for Sparse Linear Algebra Cores, the compute cores are flexible, programmable, and optimized for the sparse linear algebra that underpins all neural network computation
- ^.
The WSE is the largest chip ever made at 46,225 square millimeters in area, it is 56.7 times larger than the largest graphics processing unit. It contains 78 times more AI optimized compute cores, 3,000 times more high speed, on-chip memory, 10,000 times more memory bandwidth, and 33,000 times more communication bandwidth.
- ^
- ^
- ^
- ^ . ACM Symp. on Parallelism in Algorithms and Architectures.
- ^
- ^ , Advances in Computational Mathematics, 1: 127–137, doi:10.1007/BF02070824, S2CID 6412241
- ^ . Archived(PDF) from the original on April 6, 2019 2019.
- ^