论文信息 - A survey of cache coherence schemes for multiprocessors

A survey of cache coherence schemes for multiprocessors

Schemes for cache coherence that exhibit various degrees of hardware complexity, ranging from protocols that maintain coherence in hardware, to software policies that prevent the existence of copies of shared, writable data, are surveyed. Some examples of the use of shared data are examined. These examples help point out a number of performance issues. Hardware protocols are considered. It is seen that consistency can be maintained efficiently, although in some cases with considerable hardware complexity, especially for multiprocessors with many processors. Software schemes are investigated as an alternative capable of reducing the hardware cost.<<ETX>>

P. Stenstrom

[1] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[2] James K. Archibald,et al. Cache coherence protocols: evaluation using a multiprocessor simulation model , 1986, TOCS.

[3] Alan Jay Smith,et al. Line (Block) Size Choice for CPU Cache Memories , 1987, IEEE Transactions on Computers.

[4] Alexander V. Veidenbaum,et al. A cache coherence scheme with fast selective invalidation , 1988, ISCA '88.

[5] Philip J. Woest,et al. The Wisconsin multicube: a new large-scale cache-coherent multiprocessor , 1988, ISCA '88.

[6] P. Stenström,et al. A cache consistency protocol for multiprocessors with multistage networks , 1989, ISCA.

[7] Sang Lyul Min,et al. A Timestamp-based Cache Coherence Scheme , 1989, ICPP.

[8] Erik Hagersten,et al. The Cache Coherence Protocol of the Data Diffusion Machine , 1989, PARLE.

[9] Randy H. Katz,et al. Evaluating The Performance Of Four Snooping Cache Coherency Protocols , 1989, The 16th Annual International Symposium on Computer Architecture.