Abstract | ||
---|---|---|
In this paper, we follow a new path to arrive at the idea of a COMA — a Cache Only Memory Architecture. We show how the evolution of another architecture (ADARC) leads quite naturally to the concept of a self-distributing data space, where the separate local memories, once aug- mented with special associative hardware, function as giant caches. Having come to the idea of COMA from an unusual route, we can cast a new perspective on this architectural concept, and show (1) how the same hardware that aug- ments the memories can implement a high performance net- work from off-the-shelf components; (2) how this hard- ware can reduce false sharing by implementing variable size "cache lines"; and (3) most importantly, how a COMA- based self-distributi ng data space, combined with structures from multithreaded architectures, leads naturally to auto- matic scheduling. The network thus provides a virtual shared memory where data and computation distribute themselves. This self-distributio n is fully transparent to the processors and the programmer. |
Year | Venue | Keywords |
---|---|---|
1997 | Euro-PDS | auto- matic data distribution,cache only memory architecture,interconnections networks,automatic scheduling.,multi- threaded architecture |
Field | DocType | Citations |
Computer architecture,Uniform memory access,Shared memory,Computer science,Distributed memory,Cache-only memory architecture,Data diffusion machine,Cache coloring,Memory map,Distributed shared memory | Conference | 5 |
PageRank | References | Authors |
0.57 | 7 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ronald Moore | 1 | 41 | 7.60 |
Bernd Klauer | 2 | 50 | 14.36 |
Klaus Waldschmidt | 3 | 122 | 30.92 |