The memory in modern computer systems has a highly complex hierarchy. The farther the memory from the processor, the larger it is, but also the slower. Each computer has its own architecture and its own cache memory, and it is not easy to write an algorithm that will run with equal efficiency on all computers. In this article we consider the simplest model of a two-level memory for which two cacheindependent algorithms are proposed: multiplication of full matrices and multiplication of a sparse matrix by a block vector.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Aggarwal and J. S. Vitter, “The input/output complexity of sorting and related problems,” Commun. ACM, 31, 1116–1127 (1988).
R. W. Floyd, “Permuting information in idealized two-level storage,” in: R. Miller and J. Thatcher (editors), Complexity of Computer Calculations, Plenum, (1972), p. 105–109.
E. D. Demaine, Cache-Oblivious Algorithms and Data Structures, MIT Laboratory for Computer Science, Cambridge, MA (2002).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Prikladnaya Matematika i Informatika, No. 32, pp. 97–104, 2009.
Rights and permissions
About this article
Cite this article
Laponin, V.S. Cache-independent algorithms. Comput Math Model 21, 90–96 (2010). https://doi.org/10.1007/s10598-010-9056-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10598-010-9056-8