Minimizing the Directory Size for Large-Scale Shared-Memory Multiprocessors
Summary :
Directory-based cache coherence schemes are commonly used in large-scale shared-memory multiprocessors, but most of them rely on heuristics to avoid large hardware requirements. We proposed using physical address mapping on directories to significantly reduce directory size needed. This approach allows the size of directory to grow as O(cn log2 n) as in optimal pointer-based directory schemes [11], where n is the number of nodes in the system and c is the number of cache lines in each cache memory. Performance aspects of the proposed scheme are studied in detail using simulation.
- Publication
- IEICE TRANSACTIONS on Information Vol.E88-D No.11 pp.2533-2543
- Publication Date
- 2005/11/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietisy/e88-d.11.2533
- Type of Manuscript
- PAPER
- Category
- Computer Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jinseok KONG, Pen-Chung YEW, Gyungho LEE, "Minimizing the Directory Size for Large-Scale Shared-Memory Multiprocessors" in IEICE TRANSACTIONS on Information,
vol. E88-D, no. 11, pp. 2533-2543, November 2005, doi: 10.1093/ietisy/e88-d.11.2533.
Abstract: Directory-based cache coherence schemes are commonly used in large-scale shared-memory multiprocessors, but most of them rely on heuristics to avoid large hardware requirements. We proposed using physical address mapping on directories to significantly reduce directory size needed. This approach allows the size of directory to grow as O(cn log2 n) as in optimal pointer-based directory schemes [11], where n is the number of nodes in the system and c is the number of cache lines in each cache memory. Performance aspects of the proposed scheme are studied in detail using simulation.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e88-d.11.2533/_p
Copy
@ARTICLE{e88-d_11_2533,
author={Jinseok KONG, Pen-Chung YEW, Gyungho LEE, },
journal={IEICE TRANSACTIONS on Information},
title={Minimizing the Directory Size for Large-Scale Shared-Memory Multiprocessors},
year={2005},
volume={E88-D},
number={11},
pages={2533-2543},
abstract={Directory-based cache coherence schemes are commonly used in large-scale shared-memory multiprocessors, but most of them rely on heuristics to avoid large hardware requirements. We proposed using physical address mapping on directories to significantly reduce directory size needed. This approach allows the size of directory to grow as O(cn log2 n) as in optimal pointer-based directory schemes [11], where n is the number of nodes in the system and c is the number of cache lines in each cache memory. Performance aspects of the proposed scheme are studied in detail using simulation.},
keywords={},
doi={10.1093/ietisy/e88-d.11.2533},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Minimizing the Directory Size for Large-Scale Shared-Memory Multiprocessors
T2 - IEICE TRANSACTIONS on Information
SP - 2533
EP - 2543
AU - Jinseok KONG
AU - Pen-Chung YEW
AU - Gyungho LEE
PY - 2005
DO - 10.1093/ietisy/e88-d.11.2533
JO - IEICE TRANSACTIONS on Information
SN -
VL - E88-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2005
AB - Directory-based cache coherence schemes are commonly used in large-scale shared-memory multiprocessors, but most of them rely on heuristics to avoid large hardware requirements. We proposed using physical address mapping on directories to significantly reduce directory size needed. This approach allows the size of directory to grow as O(cn log2 n) as in optimal pointer-based directory schemes [11], where n is the number of nodes in the system and c is the number of cache lines in each cache memory. Performance aspects of the proposed scheme are studied in detail using simulation.
ER -
English
