Recursive storage cache memory for matrix multiplication

The memory of modern computer is layered in a hierarchy, top to bottom primary cache, secondary cache, main memory, virtual memory and distributed memory with more levels to come in the future. Our goal is to automatically achieve that of fine-tuned algorithms on a multi-level memory hierarchy. This automatically is because cache oblivious algorithms no knowledge about any capacity and block size of each level of the hierarchy. In this paper an efficient techniques is proposed to manage cache memory. The new technique uses block recursive structure of two types only. The algorithm is tested on famous problem of matrix multiplication. It avoids jumps and cache misses are reduced to the order of N³ √L√M.