Minimizing the Directory Size for Large-scale DSM Multiprocessors
1999-01-09
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Minimizing the Directory Size for Large-scale DSM Multiprocessors
Authors
Published Date
1999-01-09
Publisher
Type
Report
Abstract
Directory-based cache coherence schemes are commonly used in large-scale distributed shared-memory (DSM) multiprocessors, but most of them rely on heuristics to avoid large hardware requirements. We proposed to use physical address mapping on the memory modules to significantly reduce the directory size needed. This approach allows the size of directory to grow as O (cn log2n) as in optimal pointer-based directory schemes [10], where n is the number of nodes in the system and c is the number of cache lines in each cache memory. Our simulations show that the proposed scheme can achieve a performance equivalent to the heuristic pointer-based directory schemes, but with a smaller directory size and a simpler pointer management scheme.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Kong, Jinseok; Yew, Pen-Chung; Lee, Gyungho. (1999). Minimizing the Directory Size for Large-scale DSM Multiprocessors. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215370.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.