A distributed cache coherence protocol for hypercube multiprocessors
Conference
·
OSTI ID:98896
- Texas A&M Univ., College Station, TX (United States)
This paper proposes a distributed directory cache coherence protocol and compares the performance of the proposed protocol with fully mapped and single linked list protocols for the hypercube multiprocessors. The directories of shared blocks are maintained as a tree structure which is motivated by the similarity of the indirect binary n-cube to the direct binary n-cube. The proposed protocol also takes advantage of the wormhole routing technique. Compared to the fully mapped and single linked list schemes, the proposed protocol reduces the memory reference latency and the network traffic.
- OSTI ID:
- 98896
- Report Number(s):
- CONF-940856--; CNN: Grant MIP-9301959
- Country of Publication:
- United States
- Language:
- English
Similar Records
Efficient and scalable cache coherence schemes for shared memory hypercube multiprocessors
Analysis of cache invalidation patterns in multiprocessors
Multigrid algorithms on the hypercube multiprocessor
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:87654
Analysis of cache invalidation patterns in multiprocessors
Technical Report
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5849938
Multigrid algorithms on the hypercube multiprocessor
Journal Article
·
Fri Oct 31 23:00:00 EST 1986
· IEEE Trans. Comput.; (United States)
·
OSTI ID:7152157