Cache Complexity of Cache-Oblivious Approaches: A Review and Extension

The latest direction in cache-aware/cache-efficient algorithms is to use cache-oblivious algorithms based on the cache-oblivious model, which is an improvement of the external-memory model. The cache-oblivious model utilizes memory hierarchies without knowing memories’ parameters in advance since algorithms of this model are automatically tuned according to the actual memory parameters. As a result, cache-oblivious algorithms are particularly applied to multi-level caches with changing parameters and to environments in which the amount of available memory for an algorithm can fluctuate. This paper shows the state of the art in cache-oblivious algorithms and data structures; each with its complexity concerning cache misses, which is called cache complexity. Additionally, this paper intro-duces an extension to minimize the cache complexity of neural networks by applying an appropriate cache-oblivious approach to neural networks.

@article{Abuqaddom2022,
  title     = {Cache Complexity of Cache-Oblivious Approaches: A Review and Extension},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {13},
  number    = {5},
  year      = {2022},
  publisher = {The Science and Information Organization},
  author    = {Inas Abuqaddom and Sami Serhan and Basel A. Mahafzah},
  doi       = {10.14569/IJACSA.2022.01305112},
  url       = {https://doi.org/10.14569/IJACSA.2022.01305112}
}