Reducing Memory and Traffic Requirements for Scalable Directory-Based Cache Coherence Schemes

As multiprocessors are scaled beyond single bus systems, there is renewed interest in directory-based cache coherence schemes. These schemes rely on a directory to keep track of all processors caching a memory block. When a write to that block occurs, pointto-point invalidation messages are sent to keep the caches coherent. A straightforward way of recording the identities of processors caching a memory block is to use a bit vector per memory block, with one bit per processor. Unfortunately, when the main memory grows linearly with the number of processors, the total size of the directory memory grows as the square of the number of processors, which is prohibitive for large machines. To remedy this problem several schemes that use a limited number of pointers per directory entry have been suggested. These schemes often cause excessive invalidation traffic. In this paper, we propose two simple techniques that significantly reduce invalidation traffic and directory memory requirements. ...

• Type: Conference
• Year: 1990
• Where: ICPP
• Authors: Anoop Gupta, Wolf-Dietrich Weber, Todd C. Mowry
• Keywords: Directory Memory, Distributed And Parallel Computing, ICPP 1990, Invalidation Traffic, Memory Blocks