프로세서에서 마지막 레벨 캐시의 성능 개선 위한 캐시 교체정책
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이상정 | - |
dc.contributor.author | 조영일 | - |
dc.date.accessioned | 2021-08-11T21:26:14Z | - |
dc.date.available | 2021-08-11T21:26:14Z | - |
dc.date.created | 2021-06-17 | - |
dc.date.issued | 2015 | - |
dc.identifier.issn | 1975-7700 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/11400 | - |
dc.description.abstract | Reduction in cache miss rates continues to be an important issue in processor design, especially at the last level cache(LLC). The Least Recently Used(LRU) replacement policy has been widely adapted in processors for the past decades. The LRU replacement policy represents the cache blocks in a set as LRU stack. So, it only use the recency information. And it is expensive to implement in hardware. Also in some workload, it raises the thrashing, i.e., blocks with high reuse evicting each other from the cache. We propose an new replacement policy to solve problems of LRU replacement policy. In the proposed policy, a incoming block is inserted at the bottom of the set. To exploit the frequency information, a hit block exchanges its position with its adjacent block above in the set. A victim block can be chosen from bottom. Selecting the bottom block as the victim makes the proposed policy to protect the cache from polluting by less frequently used blocks. It also proposes to divide the blocks in a cache set into groups to resolve the thrashing. The victim block is selected alternately from each group. The proposed policy reduces the average MPKI(Miss Per Kilo Instructions) of the baseline 1MB 16-way LLC cache using LRU replacement policy by 12.9%. It reduces the storage requirement by 47% compared to LRU replacement policy. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | 한국지식정보기술학회 | - |
dc.title | 프로세서에서 마지막 레벨 캐시의 성능 개선 위한 캐시 교체정책 | - |
dc.title.alternative | A Cache Replacement Policy for Improving the Performance of Last Level Cache in Processors | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 이상정 | - |
dc.identifier.bibliographicCitation | 한국지식정보기술학회 논문지, v.10, no.2, pp.145 - 152 | - |
dc.relation.isPartOf | 한국지식정보기술학회 논문지 | - |
dc.citation.title | 한국지식정보기술학회 논문지 | - |
dc.citation.volume | 10 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 145 | - |
dc.citation.endPage | 152 | - |
dc.type.rims | ART | - |
dc.identifier.kciid | ART001984992 | - |
dc.description.journalClass | 2 | - |
dc.description.journalRegisteredClass | kci | - |
dc.subject.keywordAuthor | Replacement policies | - |
dc.subject.keywordAuthor | LRU | - |
dc.subject.keywordAuthor | Recency | - |
dc.subject.keywordAuthor | Frequency | - |
dc.subject.keywordAuthor | Thrashing | - |
dc.subject.keywordAuthor | Last level cache | - |
dc.subject.keywordAuthor | Victims | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(31538) 22, Soonchunhyang-ro, Asan-si, Chungcheongnam-do, Republic of Korea+82-41-530-1114
COPYRIGHT 2021 by SOONCHUNHYANG UNIVERSITY ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.