Bibliographic Details
| Title: |
Hierarchical Binary Set Partitioning in Cache Memories. |
| Authors: |
Zarandi, Hamid Reza1 zarandi@ce.sharif.edu, Sarbazi-Azad, Hamid1,2 azad@sharif.edu |
| Source: |
Journal of Supercomputing. Feb2005, Vol. 31 Issue 2, p185-202. 18p. |
| Subjects: |
Memory hierarchy (Computer science), Cache memory, Computer storage devices, Computer science, Associative storage |
| Abstract: |
In this paper, a new cache placement scheme is proposed to achieve higher hit ratios with respect to the two conventional schemes namely set-associative and direct mapping. Similar to set-associative, in this scheme, cache space is divided into sets of different sizes. Hence, the length of tag fields associated to each set is also variable and depends on the partition it is in. The proposed mapping function has been simulated with some standard trace files and statistics are gathered and analyzed for different cache configurations. The results reveal that the proposed scheme exhibits a higher hit ratio compared to the two well-known mapping schemes, namely set-associative and direct mapping, using LRU replacement policy. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
