A Data Locality for Z-Curve Cache Oblivious Matrix Multiplication Algorithms

Download Now
Provided by: International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)
Topic: Storage
Format: PDF
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. The authors' 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. They tested the famous problem of matrix multiplication using sequential access processing which decreases the blocks as compare to peano curve cache oblivious matrix multiplication.
Download Now

Find By Topic