可计算压缩矩阵
Computable Compressed Matrices
摘要:
在任何现代计算机中,使用大型矩阵进行计算的最大成本与内存延迟和带宽有关。现代RAM读取的平均延迟是处理器时钟步长的150倍。CPU的吞吐量稍微好一点,但仍然比CPU消耗的速度慢25倍。位串压缩的应用允许将较大的矩阵完全移动到计算机的高速缓存存储器中,其具有更好的延迟和带宽(L1高速缓存的平均延迟为3到4个时钟步长)。这允许大规模的性能提升以及有效模拟更大模型的能力。在这项工作中,我们提出了一种方法来压缩矩阵,以这样一种方式,他们保留其数学性质。相当大的压缩的数据也实现了在这个过程中,从而允许更大的线性问题的计算在相同的内存限制相比,传统的矩阵表示。
英文摘要:
The biggest cost of computing with large matrices in any modern computer is related to memory latency and bandwidth. The average latency of modern RAM reads is 150 times greater than a clock step of the processor. Throughput is a little better but still 25 times slower than the CPU can consume. The application of bitstring compression allows for larger matrices to be moved entirely to the cache memory of the computer, which has much better latency and bandwidth (average latency of L1 cache is 3 to 4 clock steps). This allows for massive performance gains as well as the ability to simulate much larger models efficiently. In this work, we propose a methodology to compress matrices in such a way that they retain their mathematical properties. Considerable compression of the data is also achieved in the process Thus allowing for the computation of much larger linear problems within the same memory constraints when compared with the traditional representation of matrices.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。