Research Journal of Information Technology1815-74322151-7959Science International10.3923/rjit.2011.61.67KordeP.S. KhanaleP.B. 1201131Hardware 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.]]>Bader, M.A., Z. Duan, J. Iacono and J. Wu,20022002pp: 2938Coppersmith, D. and S. Winograd,19909251280Demaine, E.D.,2002Gunther, F., M. Mehl, M. Pogl and C. Zenger,19992816341650Charles, M.F., E. Leiserson, H. Prokop and S. Ramachandaran,19991999pp: 3240Prokop, H.,19991999Goto, K. and R. van de Geijn,20042004Frigo, M.,199934169180Whaley, R.C., A. Petitet and J.J. Dongarra,200127335