Name
Abstract | ||
|---|---|---|
This paper proposes a new coherence method called "multicast snooping" that dynamically adapts between broadcast snooping and a directory protocol. Multicast snooping is unique because processors predict which caches should snoop each coherence transaction by specifying a multicast "mask." Transactions are delivered with an ordered multicast network, such as an Isotach network, which eliminates the need for acknowledgment messages. Processors handle transactions as they would with a snooping protocol, while a simplified directory operates in parallel to check masks and gracefully handle incorrect ones (e.g., previous owner missing). Preliminary performance numbers with mostly SPLASH-2 benchmarks running on 32 processors show that we can limit multicasts to an average of 2-6 destinations (<< 32) and we can deliver 2-5 multicasts per network cycle (>> broadcast snooping's 1 per cycle). While these results do not include timing, they do provide encouragement that multicast snooping can obtain data directly (like broadcast snooping) but apply to larger systems (like directories). |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1145/300979.301004 | ISCA '08 Proceedings of the 35th Annual International Symposium on Computer Architecture |
Keywords | DocType | Volume |
power transmission lines,sun,broadcasting,coherence,databases,computational modeling,protocols,bandwidth | Conference | 27 |
Issue | ISSN | ISBN |
2 | 0163-5964 | 0-7695-0170-2 |
Citations | PageRank | References |
49 | 2.49 | 34 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| E. Ender Bilir | 1 | 49 | 2.49 |
| Ross M. Dickson | 2 | 49 | 2.49 |
| Ying Hu | 3 | 312 | 28.67 |
| Manoj Plakal | 4 | 161 | 13.41 |
| Daniel J. Sorin | 5 | 2213 | 125.31 |
| Mark D. Hill | 6 | 7371 | 582.90 |
| David A. Wood | 7 | 6058 | 617.11 |