DMCA
Reducing Remote Conflict Misses: NUMA with Remote Cache versus COMA (1997)
| Venue: | In Proceedings of the 3rd International Symposium on High-Performance Computer Architecture |
| Citations: | 34 - 0 self |
BibTeX
@INPROCEEDINGS{Zhang97reducingremote,
author = {Zheng Zhang and Josep Torrellas},
title = {Reducing Remote Conflict Misses: NUMA with Remote Cache versus COMA},
booktitle = {In Proceedings of the 3rd International Symposium on High-Performance Computer Architecture},
year = {1997},
pages = {272--281}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Many future applications for scalable shared-memory multiprocessors are likely to have large working sets that overflow secondary or tertiary caches. Two possible solutions to this problem are to add a very large cache called remote cache that caches remote data (NUMA-RC), or organize the machine as a cache-only memory architecture (COMA). This paper tries to determine which solution is best. To compare the performance of the two organizations for the same amount of total memory, we introduce a model of data sharing. The model uses three data sharing patterns: replication, read-mostly migration, and read-write migration. Replication data is accessed in read-mostly mode by several processors, while migration data is accessed largely by one processor at a time. For large working sets, the weight of the migration data largely determines whether COMA outperforms NUMA-RC. Ideally, COMA only needs to fit the replication data in its extra memory; the migration data will simply be swapped betw...
Keyphrases
migration data remote conflict miss remote cache versus coma replication data large cache extra memory scalable shared-memory multiprocessor many future application several processor read-write migration tertiary cache possible solution read-mostly migration cache-only memory architecture remote data total memory
