Name
Abstract | ||
|---|---|---|
This paper describes a new hardware solution for the cache coherence problem in large scale shared memory multiprocessors. The protocol is based on a linked list of caches — forming a distributed directory and (to ensure a scalable design) does not require a global broadcast mechanism. Fully-mapped directory-based solutions proposed earlier also do not require a global broadcast mechanism. However, our solution has a lower cost and potentially better performance than the fully-mapped directory-based protocol. We provide simulation results to show that the performance of the distributed directory protocol is more robust when there is contention for the data and for variations in memory technology. Further, we do not assume that the network preserves the order of messages. Thus we do not preclude adaptive routing. Our solution also allows an efficient implementation of locks. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1007/3-540-53065-7_136 | CONPAR |
Keywords | Field | DocType |
scalable cache coherence,large shared memory multiprocessors,cache coherence,adaptive routing | Shared memory,MESIF protocol,Computer science,MESI protocol,Cache-only memory architecture,Memory coherence,Bus sniffing,Distributed shared memory,Cache coherence,Distributed computing | Conference |
Volume | ISSN | ISBN |
457 | 0302-9743 | 3-540-53065-7 |
Citations | PageRank | References |
1 | 0.37 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manu Thapar | 1 | 39 | 11.76 |
| Bruce Delagi | 2 | 32 | 11.90 |