Cache oblivious algorithms are designed to get the good benefit from any of the underlying hierarchy of caches without the need to know about the exact structure of the cache. These algorithms are cache oblivious i.e., no variables are dependent on hardware parameters such as cache size and cache line length. Optimal utilization of cache memory has to be done in order to get the full performance potential of the hardware. We present here the miss rate comparison of cache oblivious matrix multiplication using the sequential access recursive technique and normal multiplication program. Varying the cache size the respective miss rates in the L1 cache are taken and then comparison is done. It is found that the miss rates in the L1 cache for the cache oblivious matrix multiplication program using the sequential access recursive technique is comparatively lesser than the naive matrix multiplication program. © 2013 IEEE.