A comparison of homogeneous hierarchical interconnection structures

Among the various proposal advanced to build massive parallel systems in which the number of computing units ranges in the thousands, hierarchical topologies share a number of interesting properties. The authors review these architectures and their applicability and reliability, with particular attention to connections complexity and the ability to exchange messages. The usual assumption of the multiple instruction multiple data (MIMD) computational paradigm is as follows: autonomous but cooperating tasks execute on different processing units in the system. The overall complexity of the systems is measured with the analysis of the diameter and of the increasing law that states the number of interconnections against the number of nodes in the system. The various architectures are compared in terms of links load and average internode distance. >

[1]  D. H. Schaefer,et al.  The GAM pyramid , 1987 .

[2]  Salvatore J. Stolfo,et al.  The DADO Production System Machine , 1986, J. Parallel Distributed Comput..

[3]  Arnold L. Rosenberg,et al.  A Dictionary Machine (for VLSI) , 1982, IEEE Transactions on Computers.

[4]  Philipp W. Besslich,et al.  Pyramidal transforms in image processing and computer vision , 1986 .

[5]  B. Zavidovique,et al.  Intégration d'un processeur cellulaire pour une architecture pyramidale de traitement d'image , 1985 .

[6]  Azriel Rosenfeld,et al.  Array Automata and Array Grammars , 1971, IFIP Congress.

[7]  Hussein A. H. Ibrahim,et al.  On the application of massively parallel SIMD tree machines to certain intermediate-level vision tasks , 1986, Comput. Vis. Graph. Image Process..

[8]  Carlo H. Séquin.  Single-Chip Computers, the New VLSI Building Blocks , 1979 .

[9]  Milos D. Ercegovac,et al.  Fault Tolerance in Binary Tree Architectures , 1984, IEEE Transactions on Computers.

[10]  Narendra Ahuja,et al.  Efficient planar embedding of trees for VLSI layouts , 1986, Comput. Vis. Graph. Image Process..

[11]  Jr. Charles Richard Lang.  The extension of object-oriented languages to a homogeneous, concurrent architecture , 1982 .

[12]  S. L. Tanimoto,et al.  A prototype pyramid machine for hierarchical cellular logic , 1987 .

[13]  Bruce W. Arden,et al.  A Regular Network for Multicomputer Systems , 1982, IEEE Transactions on Computers.

[14]  John P. Hayes,et al.  A Graph Model for Fault-Tolerant Computing Systems , 1976, IEEE Transactions on Computers.

[15]  Renato Stefanelli,et al.  PAPIA: Pyramidal architecture for parallel image analysis , 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).

[16]  Marvin H. Solomon,et al.  Processor Interconnection Strategies , 1980, IEEE Transactions on Computers.

[17]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[18]  Dennis Gannon,et al.  On the structure of parallelism in a highly concurrent PDE solver , 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).

[19]  S. Toida,et al.  An optimal 2-FT realization of binary symmetric hierarchical tree systems , 1982, Networks.

[20]  Dharma P. Agrawal,et al.  Evaluating the performance of multicomputer configurations , 1986 .

[21]  Luigi Carrioli.  A Pyramidal Haar-Transform Implementation , 1986 .

[22]  Carlo H. Séquin,et al.  Hypertree: A Multiprocessor Interconnection Topology , 1981, IEEE Transactions on Computers.

[23]  W. Kent Fuchs,et al.  Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance , 1987, IEEE Transactions on Computers.

[24]  Dharma P. Agrawal,et al.  Performance of multiprocessor interconnection networks , 1989, Computer.

[25]  Janak H. Patel,et al.  NETRA: an architecture for a large scale multiprocessor vision system , 1987 .

[26]  Victor P. Nelson.  Fault-tolerant computing: fundamental concepts , 1990, Computer.

[27]  Herb Schwetman,et al.  Cost-Performance Bounds for Multimicrocomputer Networks , 1983, IEEE Transactions on Computers.

[28]  Dileep Bhandarkar,et al.  Analysis of Memory Interference in Multiprocessors , 1975, IEEE Transactions on Computers.

[29]  Kenneth E. Batcher,et al.  Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.

[30]  Dhiraj K. Pradhan,et al.  Flip-Trees: Fault-Tolerant Graphs with Wide Containers , 1988, IEEE Trans. Computers.

[31]  Dan Gordon.  Efficient Embeddings of Binary Trees in VLSI Arrays , 1987, IEEE Transactions on Computers.

[32]  C. Thomborson,et al.  A Complexity Theory for VLSI , 1980 .

[33]  Hee Yong Youn,et al.  On Implementing Large Binary Tree Architectures in VLSI and WSI , 1989, IEEE Trans. Computers.

[34]  James R. Armstrong,et al.  Fault Diagnosis in a Boolean n Cube Array of Microprocessors , 1981, IEEE Transactions on Computers.

[35]  Kai Hwang,et al.  Hypernet: A Communication-Efficient Architecture for Constructing Massively Parallel Computers , 1987, IEEE Transactions on Computers.