[미국특허]
Position-based replacement policy for address synonym management in shared caches
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-012/12
G06F-012/08
출원번호
US-0621454
(2015-02-13)
등록번호
US-9477613
(2016-10-25)
발명자
/ 주소
Berger, Deanna Postles Dunn
Fee, Michael F.
O'Neil, Jr., Arthur J.
Sonnelitter, III, Robert J.
출원인 / 주소
INTERNATIONAL BUSINESS MACHINES CORPORATION
대리인 / 주소
Cantor Colburn LLP
인용정보
피인용 횟수 :
0인용 특허 :
5
초록▼
A computer-implemented method includes receiving a request to access a cache entry in a shared cache. The request references a synonym for the cache entry. A cache directory of the shared cache includes, for each cache entry of the shared cache, a first-ranked synonym slot for storing a most recentl
A computer-implemented method includes receiving a request to access a cache entry in a shared cache. The request references a synonym for the cache entry. A cache directory of the shared cache includes, for each cache entry of the shared cache, a first-ranked synonym slot for storing a most recently used synonym for the cache entry and a second-ranked synonym slot for storing a second most recently used synonym for the cache entry. The method includes, based on receiving the request, writing contents of the first-ranked synonym slot for the cache entry to the second-ranked synonym slot for the cache entry, and writing the synonym referenced in the request to the first-ranked synonym slot for the cache entry.
대표청구항▼
1. A computer-implemented method, comprising: receiving a request to access a cache entry in a shared cache, the request referencing a synonym for the cache entry, a cache directory of the shared cache comprising, for each cache entry of the shared cache, a first-ranked synonym slot for storing a mo
1. A computer-implemented method, comprising: receiving a request to access a cache entry in a shared cache, the request referencing a synonym for the cache entry, a cache directory of the shared cache comprising, for each cache entry of the shared cache, a first-ranked synonym slot for storing a most recently used synonym for the cache entry and a second-ranked synonym slot for storing a second most recently used synonym for the cache entry; andbased on receiving the request: writing contents of the first-ranked synonym slot for the cache entry to the second-ranked synonym slot for the cache entry; andwriting the synonym referenced in the request to the first-ranked synonym slot for the cache entry. 2. The method of claim 1, wherein writing the contents of the first-ranked synonym slot for the cache entry to the second-ranked synonym slot for the cache entry demotes an other synonym from the second-ranked synonym slot for the cache entry. 3. The method of claim 2, wherein the cache directory comprises no more than two synonym slots for the cache entry, and wherein writing the contents of the first-ranked synonym slot for the cache entry to the second-ranked synonym slot for the cache entry demotes the other synonym from the cache directory. 4. The method of claim 1, wherein the cache directory comprises two or more synonym slots for each cache entry, and wherein a position of each synonym within the synonym slots is based on recent use relative to one or more other synonyms in the synonym slots. 5. The method of claim 4, wherein the cache directory is absent circuitry, other than the two or more synonym slots, for indicating which synonym was most recently used. 6. The method of claim 1, further comprising: receiving an other request for an other cache entry, wherein the other request references an other synonym;determining that the other synonym matches a synonym stored in the second-ranked synonym slot of the other cache entry; andswapping the synonyms in the first-ranked synonym slot and the second-ranked synonym slot of the other cache entry, responsive to determining that the other synonym matches the synonym stored in the second-ranked synonym slot of the other cache entry. 7. A system comprising: one or more computer processors configured to: receive a request to access a cache entry in a shared cache, the request referencing a synonym for the cache entry, a cache directory of the shared cache comprising, for each cache entry of the shared cache, a first-ranked synonym slot for storing a most recently used synonym for the cache entry and a second-ranked synonym slot for storing a second most recently used synonym for the cache entry; andbased on receiving the request: write contents of the first-ranked synonym slot for the cache entry to the second-ranked synonym slot for the cache entry; andwrite the synonym referenced in the request to the first-ranked synonym slot for the cache entry. 8. The system of claim 7, wherein writing the contents of the first-ranked synonym slot for the cache entry to the second-ranked synonym slot for the cache entry demotes an other synonym from the second-ranked synonym slot for the cache entry. 9. The system of claim 8, wherein the cache directory comprises no more than two synonym slots for the cache entry, and wherein writing the contents of the first-ranked synonym slot for the cache entry to the second-ranked synonym slot for the cache entry demotes the other synonym from the cache directory. 10. The system of claim 7, wherein the cache directory comprises two or more synonym slots for each cache entry, and wherein a position of each synonym within the synonym slots is based on recent use relative to one or more other synonyms in the synonym slots. 11. The system of claim 10, wherein the cache directory is absent circuitry, other than the two or more synonym slots, for indicating which synonym was most recently used. 12. The system of claim 7, the one or more processors further configured to: receive an other request for an other cache entry, wherein the other request references an other synonym;determine that the other synonym matches a synonym stored in the second-ranked synonym slot of the other cache entry; andswap the synonyms in the first-ranked synonym slot and the second-ranked synonym slot of the other cache entry, responsive to determining that the other synonym matches the synonym stored in the second-ranked synonym slot of the other cache entry. 13. A computer program product for implementing a least recently used replacement policy for synonyms in a cache directory of a shared cache, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform a method comprising: receiving a request to access a cache entry in a shared cache, the request referencing a synonym for the cache entry, a cache directory of the shared cache comprising, for each cache entry of the shared cache, a first-ranked synonym slot for storing a most recently used synonym for the cache entry and a second-ranked synonym slot for storing a second most recently used synonym for the cache entry; andbased on receiving the request: writing contents of the first-ranked synonym slot for the cache entry to the second-ranked synonym slot for the cache entry; andwriting the synonym referenced in the request to the first-ranked synonym slot for the cache entry. 14. The computer program product of claim 13, wherein writing the contents of the first-ranked synonym slot for the cache entry to the second-ranked synonym slot for the cache entry demotes an other synonym from the second-ranked synonym slot for the cache entry. 15. The computer program product of claim 14, wherein the cache directory comprises no more than two synonym slots for the cache entry, and wherein writing the contents of the first-ranked synonym slot for the cache entry to the second-ranked synonym slot for the cache entry demotes the other synonym from the cache directory. 16. The computer program product of claim 13, wherein the cache directory comprises two or more synonym slots for each cache entry, and wherein a position of each synonym within the synonym slots is based on recent use relative to one or more other synonyms in the synonym slots. 17. The computer program product of claim 16, wherein the cache directory is absent circuitry, other than the two or more synonym slots, for indicating which synonym was most recently used. 18. The computer program product of claim 13, the method further comprising: receiving an other request for an other cache entry, wherein the other request references an other synonym;determining that the other synonym matches a synonym stored in the second-ranked synonym slot of the other cache entry; andswapping the synonyms in the first-ranked synonym slot and the second-ranked synonym slot of the other cache entry, responsive to determining that the other synonym matches the synonym stored in the second-ranked synonym slot of the other cache entry.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (5)
Perry Ron B., High performance mechanism for managing allocation of virtual memory buffers to virtual processes on a least recently used basis.
Gharachorloo,Kourosh; Barroso,Luiz A.; Stets, Jr.,Robert J.; Ravishankar,Mosur K.; Nowatzyk,Andreas, System and method for limited fanout daisy chaining of cache invalidation requests in a shared-memory multiprocessor system.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.