Abstract
A problem "around since antiquity" may have been resolved by a new algorithm.
- Fürer, M. Faster Integer Multiplication. SIAM J. Comput., Volume 39 Issue 3, 2009, pages 979-1005. http://bit.ly/2CFvmG6. Google ScholarDigital Library
- Harvey, D. and van der Hoeven, J. Integer Multiplication in Time O(nlogn). http://bit.ly/2QcOrr6.Google Scholar
- Karatsuba, A. The Complexity of Computations. Proceedings of the Steklov Institute of Mathematics, Volume 211, 1995, pages 169-183. http://bit.ly/32M1oed.Google Scholar
- Schönhage, A. and Strassen, V. Schnelle Multiplikation grosser Zahlen. Computing, Volume 7, Issue 3-4, September 1971, pages 281-292. https://link.springer.com/article/10.1007/BF02242355.Google ScholarCross Ref
Index Terms
- Multiplication hits the speed limit
Recommendations
Design of low speed no - speed sensor for permanent magnet synchronous motor
ISBDAI '18: Proceedings of the International Symposium on Big Data and Artificial IntelligenceSpeed Sensorless Control Technology of Permanent Magnet Synchronous Motor at Low SpeedMainly based on the salient pole characteristics of the motor, injecting high frequency excitation signals and noise filters requiring high bandwidth, It can detect ...
Caching with Delayed Hits
SIGCOMM '20: Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communicationCaches are at the heart of latency-sensitive systems. In this paper, we identify a growing challenge for the design of latency-minimizing caches called delayed hits. Delayed hits occur at high throughput, when multiple requests to the same object queue ...
Matrix multiplication: a case study of enhanced data cache utilization
Modern machines present two challenges to algorithm engineers and compiler writers: They have superscalar, super-pipelined structure, and they have elaborate memory subsystems specifically designed to reduce latency and increase bandwidth. Matrix ...
Comments