A Spatial Locality-based Block Replacement Algoritghm in Cache Memories

Please enable javascript in your browser.

Ardalani, Newsha | 2010

487 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 40712 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Sarbazi-Azad, Hamid
Abstract:
From the programmer’s point of view, main memory allocation to a program is contigious, however this is non-contigious and the program is scattered in physical memory here and there. Assuming main memory partitioned into regions, each program accesses in its life time different regions which are not necessariliy close and occupy different percentages of the cache capacity. Considering what the replacement policy is chosen, the cache would be partitioned differently among regions, e.g., the commonly used LRU policy partitions the cache among regions on a demand basis, giving the more cache resource to regions whose miss ratio is higher, which is not necessarily optimal. In this thesis, we propse a low overhead spatial-based replacement policy which partitions the cache among regions based upon utility rather than demand. Our evaluations show that our spatial-based replacement policy improves performance of a single core system by up to 125% and on average 13% and performance of a quad-core system up to 15% and on average 3% over LRU replacement policy
Keywords:
Cache Memory ; Efficiency ; Multiprocessors ; Spatial Locality ; Single Core Processor

No TOC