Using Destination-Set Prediction to Improve the Latency/Bandwidth Tradeoff in . . . (2003)
Cached
Download Links
- [www.cs.wisc.edu]
- [www.ee.duke.edu]
- [www.cis.upenn.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 30th Annual International Symposium on Computer Architecture |
| Citations: | 48 - 7 self |
BibTeX
@INPROCEEDINGS{Martin03usingdestination-set,
author = {Milo M. K. Martin and Pacia J. Harper and Daniel J. Sorin and Mark D. Hill and David A. Wood},
title = {Using Destination-Set Prediction to Improve the Latency/Bandwidth Tradeoff in . . .},
booktitle = {In Proceedings of the 30th Annual International Symposium on Computer Architecture},
year = {2003},
pages = {206--217}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Destination-set prediction can improve the latency/bandwidth tradeoff in shared-memory multiprocessors. The destination set is the collection of processors that receive a particular coherence request. Snooping protocols send requests to the maximal destination set (i.e., all processors) , reducing latency for cache-to-cache misses at the expense of increased traffic. Directory protocols send requests to the minimal destination set, reducing bandwidth at the expense of an indirection through the directory for cache-to-cache misses. Recently proposed hybrid protocols trade-off latency and bandwidth by directly sending requests to a predicted destination set.
