Name
Abstract | ||
|---|---|---|
In flat cache-only memory architectures (COMA), an attraction-memory miss must first interrogate a directory before a copy of the requested data can be located, which often involves three network traversals. By keeping track of the identity of a potential holder of the copy–called a hint–one network traversal can be saved which reduces the read penalty. We have evaluated the reduction of the read-... |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1093/comjnl/40.4.208 | The Computer Journal |
Keywords | Field | DocType |
computer and information science,cache only memory architecture | Tree traversal,CPU cache,Computer science,Directory,Parallel computing,Computer network,Distributed computing,Information and Computer Science,Performance improvement | Journal |
Volume | Issue | ISSN |
40 | 4 | 0010-4620 |
Citations | PageRank | References |
1 | 0.36 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fredrik Dahlgren | 1 | 10 | 1.62 |
| Per Stenström | 2 | 3048 | 234.09 |
| Mårten Björkman | 3 | 202 | 13.90 |