|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| David Chaiken, Craig Fields, Kiyoshi Kurihara, Anant Agarwal, "Directory-Based Cache Coherence in Large-Scale Multiprocessors," Computer, vol. 23, no. 6, pp. 49-58, June, 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/2.55500, author = {David Chaiken and Craig Fields and Kiyoshi Kurihara and Anant Agarwal}, title = {Directory-Based Cache Coherence in Large-Scale Multiprocessors}, journal ={Computer}, volume = {23}, number = {6}, issn = {0018-9162}, year = {1990}, pages = {49-58}, doi = {http://doi.ieeecomputersociety.org/10.1109/2.55500}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - Computer TI - Directory-Based Cache Coherence in Large-Scale Multiprocessors IS - 6 SN - 0018-9162 SP49 EP58 EPD - 49-58 A1 - David Chaiken, A1 - Craig Fields, A1 - Kiyoshi Kurihara, A1 - Anant Agarwal, PY - 1990 VL - 23 JA - Computer ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2.55500
The usefulness of shared-data caches in large-scale multiprocessors, the relative merits of different coherence schemes, and system-level methods for improving directory efficiency are addressed. The research presented is part of an effort to build a high-performance, large-scale multiprocessor. The various classes of cache directory schemes are described, and a method of measuring cache coherence is presented. The various directory schemes are analyzed, and ways of improving the performance of directories are considered. It is found that the best solutions to the cache-coherence problem result from a synergy between a multiprocessor's software and hardware components.
Citation:
David Chaiken, Craig Fields, Kiyoshi Kurihara, Anant Agarwal, "Directory-Based Cache Coherence in Large-Scale Multiprocessors," Computer, vol. 23, no. 6, pp. 49-58, June 1990, doi:10.1109/2.55500
Usage of this product signifies your acceptance of the Terms of Use.

