DocumentCode
3486453
Title
Linked list cache coherence for scalable shared memory multiprocessors
Author
Thapar, Manu ; Delagi, Bruce ; Flynn, Michael J.
Author_Institution
Hewlett Packard Res. Lab., Palo Alto, CA, USA
fYear
1993
fDate
13-16 Apr 1993
Firstpage
34
Lastpage
43
Abstract
This paper presents a singly-linked distributed directory (SDD) cache coherence protocol and compares the performance of the SDD protocol with the fully mapped centralized directory protocol and the IEEE SCI Standard protocol. To maintain coherence, the SDD protocol uses a linked list of cache lines that contain shared copies of the data. The protocol has scalable cost. Coherency related messages are not required to be delivered in order, thus allowing adaptive routing, making the performance more robust in the presence of congested networks. The authors analysis shows that the SDD protocol has generally better performance in the presence of memory and interconnect contention. They discuss the various factors, such as memory reference behavior and interconnect traffic, that affect the performance of these protocols
Keywords
buffer storage; data structures; protocols; shared memory systems; standards; IEEE SCI Standard protocol; adaptive routing; fully mapped centralized directory protocol; interconnect contention; linked list cache coherence; memory reference behavior; performance; protocol; scalable shared memory multiprocessors; singly-linked distributed directory; Access protocols; Broadcasting; Computer architecture; Costs; Memory architecture; Milling machines; Performance analysis; Robustness; Sun; Watches;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1993., Proceedings of Seventh International
Conference_Location
Newport, CA
Print_ISBN
0-8186-3442-1
Type
conf
DOI
10.1109/IPPS.1993.262852
Filename
262852
Link To Document