Name
Abstract | ||
|---|---|---|
Interconnection structures that can provide access to multiple levels of a shared memory hierarchy in a multiprocessor are investigated. The results are also applicable to distributed memory architectures in which localities of communication can be statically defined. All the structures presented conform in some fashion to the binary cube topology, with per-processor logic cost ranging from O (log N ) to O (log 2 N ). The results illustrate that without resorting to separate networks for access at each level, several architectures can provide fast access at tower levels in the hierarchy and progressively slower access at higher levels. Even at the highest communication level (corresponding to systemwide communication), messages encounter less delay than in a nonhierarchical access situation. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0743-7315(91)90038-B | J. Parallel Distrib. Comput. |
Keywords | Field | DocType |
efficient architecture,shared memory hierarchy,data access,shared memory | Binary logarithm,Uniform memory access,Shared memory,Computer science,Parallel computing,Computer network,Distributed memory,Multiprocessing,Interconnection,Hierarchy,Data access,Distributed computing | Journal |
Volume | Issue | ISSN |
11 | 4 | Journal of Parallel and Distributed Computing |
Citations | PageRank | References |
6 | 0.63 | 14 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Krishnan Padmanabhan | 1 | 305 | 33.55 |