Subscribe Now Subscribe Today
Science Alert
Curve Top
Research Journal of Information Technology
  Year: 2011 | Volume: 3 | Issue: 1 | Page No.: 61-67
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Cache Oblivious Matrix Multiplication Algorithm using Sequential Access Processing

P.S. Korde and P.B. Khanale

Hardware implements cache as a block of memory for temporary storage of data likely to be used again. Cache Oblivious Algorithms are typically analyzed using an idealized model of cache, but it is much easier to analyze than a real cache memory. Researchers have used cache oblivious algorithms for element ordering, matrix multiplication, matrix transposition and fast Fourier transform. In this study an efficient technique 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 N3/L√M.
PDF Fulltext XML References Citation Report Citation
  •    A Fast and Power Efficient Updating Algorithm for Partitioned TCAMs
How to cite this article:

P.S. Korde and P.B. Khanale, 2011. Cache Oblivious Matrix Multiplication Algorithm using Sequential Access Processing. Research Journal of Information Technology, 3: 61-67.




Curve Bottom