Abstract
Performance of three binding schemes for memory local to a node is evaluated. Since a large number of cache misses can occur in a large (relative to the cache size) working set, binding at & page fault time alone cannot efficiently utilize locality of reference at the local memory. In a small working set, the address bound to the local memory at a node miss time is not effective due to low cache miss rates. Our simulation shows that binding at a cache miss time achieves up to 3.1 times and 2.4 times performance of the schemes of binding at a page fault time and at a node miss time respectively.
| Original language | English |
|---|---|
| Pages (from-to) | 2148-2151 |
| Number of pages | 4 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E87-D |
| Issue number | 8 |
| Publication status | Published - 2004 Aug |
| Externally published | Yes |
Keywords
- COMA
- Distributed shared memory
- Multiprocessor
- cc-NUMA
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence
Fingerprint Dive into the research topics of 'Binding time in distributed shared memories for generic patterns of memory references'. Together they form a unique fingerprint.
Cite this
Kong, J., & Lee, G. (2004). Binding time in distributed shared memories for generic patterns of memory references. IEICE Transactions on Information and Systems, E87-D(8), 2148-2151.