An efficient tree cache coherence protocol for distributed shared memory multiprocessors

Directory schemes have long been used to solve the cache coherence problem for large scale shared memory multiprocessors. In addition, tree-based protocols have been employed to reduce the directory size and the invalidation latency for a large degree of data sharing in the system. However, the exis...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on computers Ročník 48; číslo 3; s. 352 - 360
Hlavní autoři: Yeimkuan Chang, Bhuyan, L.N.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.03.1999
Institute of Electrical and Electronics Engineers
Témata:
Access methods and protocols, osi model
Applied sciences
Balances (scales)
Broadcasting
Coherence
Computer science; control theory; systems
Computer simulation
Computer systems and distributed systems. User interface
Degradation
Delay
Directories
Exact sciences and technology
Large-scale systems
Lists
Memory and file management (including protection and security)
Memory organisation. Data processing
Multiprocessor
Multiprocessor interconnection networks
Parallel processing
Parallel programming
Protocols
Running
Software
System performance
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Trees
Distributed memory multiprocessor system
Computer simulation
Cache memory
Storage management
Performance analysis
Parallel computer
Access protocol
Distributed system
ISSN:0018-9340
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Directory schemes have long been used to solve the cache coherence problem for large scale shared memory multiprocessors. In addition, tree-based protocols have been employed to reduce the directory size and the invalidation latency for a large degree of data sharing in the system. However, the existing tree-based protocols involve a very high communication overhead for maintaining a balanced tree, especially when the degree of data sharing is low. This paper presents a new tree-based cache coherence protocol which is a hybrid of the limited directory and the linked list schemes. By utilizing a limited number of pointers in the directory, the proposed protocol connects the nodes caching a shared block in a tree fashion without incurring any communication overhead. In addition to the low communication overhead, the proposed scheme also possesses the advantages of the existing bit-map and tree-based linked list protocols, namely, scalable memory requirement and logarithmic invalidation latency. We evaluate the performance of our protocol by running four applications on the Proteus execution-driven simulator. Our simulation results show that the performance of the proposed protocol is very close to that of the full-map protocol.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
DOI:10.1109/12.755001