ACM Home Page
Please provide us with feedback. Feedback
A consistency architecture for hierarchical shared caches
Full text PdfPdf (395 KB)
Source
ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures table of contents
Munich, Germany
SESSION: Special track: multicores table of contents
Pages 11-22  
Year of Publication: 2008
ISBN:978-1-59593-973-9
Authors
Edya Ladan-Mozes  Massachusetts Institute of Technology, Cambridge, MA, USA
Charles E. Leiserson  Massachusetts Institute of Technology, Cambridge, MA, USA
Sponsors
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 202,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1378533.1378536
What is a DOI?

ABSTRACT

Hierarchical Cache Consistency (HCC) is a scalable cache-consistency architecture for chip multiprocessors in which caches are shared hierarchically. HCC's cache-consistency protocol is embedded in the message-routing network that interconnects the caches, providing a distributed and scalable alternative to bus-based and directory-based consistency mechanisms. The HCC consistency protocol is "progressive" in that every message makes monotonic progress without timeouts, retries, negative acknowledgments, or retreating in any way. The latency is at most proportional to the diameter of the network. For HCC with a binary fat-tree network, the protocol requires at most 13 bits of additional state per cache line, no matter how large the system. We prove that the HCC protocol is deadlock free and provides sequential consistency.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
Advanced Micro Devices. AMD64 Architecture Programmer's Manual, Volume 2: System Programming, July 2007.
 
5
A. Agarwal, R. Simoni, J. Hennessy, and M. Horowitz. An evaluation of directory schemes for cache coherence. In ISCA, 2008.
 
6
7
 
8
9
 
10
11
12
13
 
14
 
15
M. Frigo. The weakest reasonable memory model. Master's thesis, MIT EECS, 1998.
16
 
17
 
18
Intel Corporation. Intel 64 and IA-32 Architectures Software Developer's Manual, Volume 3A: System Programming Guide, Part 1, October 2006.
19
20
21
22
 
23
 
24
 
25
26
27
 
28
29
30
31
 
32
H. Nilsson and P. Stenstrom. The scalable tree protocol-a cache coherence approach for large-scale multiprocessors. In IPDPS, 1992.
 
33
34
35
 
36
X. Shen and Arvind. Specification of memory models and design of provably correct cache coherence protocols. Technical Report 398, MIT Computation Structures Group, 1997.
37
38
39
40
 
41

Collaborative Colleagues:
Edya Ladan-Mozes: colleagues
Charles E. Leiserson: colleagues