Directory-Based Cache Coherence Scheme Using Number-Balanced Binary Tree

The cache coherence problem is a major issue in the design of shared memory multiprocessor systems. The directory-based scheme is an attractive approach to solve the cache coherence problem in a large-scale multiprocessor system. However, the existing directory-based schemes have many problems such as storage overhead, invalidation delay, and network traffic and concentration. In this paper, we propose a new directory-based scheme(BIND) based on a number-balanced binary tree. The BIND scheme can significantly reduce invalidation latency, directory memory requirements, and network traffic as compared to the existing directory-based schemes.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1993-01
Language
ENG
Citation

MICROPROCESSING AND MICROPROGRAMMING, v.37, no.1-5, pp.37 - 40

ISSN
0165-6074
URI
http://hdl.handle.net/10203/63287
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 124
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0