| The mesh superceded? |
| Full text |
Pdf
(525 KB)
|
| Source
|
ACM Annual Computer Science Conference
archive
Proceedings of the 17th conference on ACM Annual Computer Science Conference
table of contents
Louisville, Kentucky
Pages: 180 - 187
Year of Publication: 1989
ISBN:0-89791-299-3
|
|
Author
|
|
L. V. Kale
|
Department of Computer Science, University of Illinois at Urbana-Champaign
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 0, Downloads (12 Months): 2, Citation Count: 0
|
|
|
ABSTRACT
Two dimensional interconnection schemes have some inherent advantages because of their linear area and constant wire-lengths. The nearest-neighbor mesh is such a topology that has enjoyed a widespread acceptance. We investigate a family of bus-based topologies called the doble-lattice-meshes, and propose a variation to improve their properties. We show that the bus-based topologies perform better than the mesh for a variety of communicaion structures. In particular, when global communication is needed, they provide larger effective bandwidth, and when localized communication is permissible, they provide largest neighborhoods for a given communication capacity.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
S. Ahuja, "S/Net: A High Speed Interconnect for Multiple Computers", IEEE Journal on Selected Area8 in Communicationa, SAC-l, 5 (November 1983), .
|
| |
2
|
|
| |
3
|
|
| |
4
|
J. D. Harris and H. E. T. Connell, "An Interconnection Scheme for a tightly coupled massively parallel computer network", Proceedings of ICCD, PortChester, N.Y., 1985.
|
| |
5
|
L.V. Kale, "Lattice-Mesh: a Multi-Bus Topology", Proc. of ICPP, St. Charles, Illinois, August 1985.
|
| |
6
|
|
| |
7
|
L. V. Kale, "Optimal Communication neighborhoods", Proc. of ICPP, St. Charles, Illinois, August 1986.
|
 |
8
|
|
| |
9
|
|
| |
10
|
J. D. Ullman, "Flux, Sorting and Supercomputer Organization for AI Applications", Your,al of Parallel and Distributed Computing, 1, (1984), 133-151.
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|