Dynamic self-invalidation
- 1 May 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 23 (2) , 48-59
- https://doi.org/10.1145/225830.223995
Abstract
This paper introduces dynamic self-invalidation (DSI), a new technique for reducing cache coherence overhead in shared-memory multiprocessors. DSI eliminates invalidation messages by having a processor automatically invalidate its local copy of a cache block before a conflicting access by another processor. Eliminating invalidation overhead is particularly important under sequential consistency, where the latency of invalidating outstanding copies can increase a program's critical path.DSI is applicable to software, hardware, and hybrid coherence schemes. In this paper we evaluate DSI in the context of hardware directory-based write-invalidate coherence protocols. Our results show that DSI reduces execution time of a sequentially consistent full-map coherence protocol by as much as 41%. This is comparable to an implementation of weak consistency that uses a coalescing write-buffer to allow up to 16 outstanding requests for exclusive blocks. When used in conjunction with weak consistency, DSI can exploit tear-off blocks---which eliminate both invalidation and acknowledgment messages---for a total reduction in messages of up to 26%.Keywords
This publication has 25 references indexed in Scilit:
- A case for NOW (Networks of Workstations)IEEE Micro, 1995
- Parallel programming in Split-CPublished by Association for Computing Machinery (ACM) ,1993
- Cache coherence using local knowledgePublished by Association for Computing Machinery (ACM) ,1993
- Cooperative shared memoryPublished by Association for Computing Machinery (ACM) ,1992
- SPLASHACM SIGARCH Computer Architecture News, 1992
- DDM-a cache-only memory architectureComputer, 1992
- Design and analysis of a scalable cache coherence scheme based on clocks and timestampsIEEE Transactions on Parallel and Distributed Systems, 1992
- Tolerating latency through software-controlled prefetching in shared-memory multiprocessorsJournal of Parallel and Distributed Computing, 1991
- LimitLESS directoriesPublished by Association for Computing Machinery (ACM) ,1991
- Weak ordering---a new definitionPublished by Association for Computing Machinery (ACM) ,1990