RCC-Full: An Effective Network for Parallel Computations

A new interconnection network is proposed for the construction of a massively parallel computer system. The systematic construction of this interconnection network, denoted RCC-FULL, is performed by methodically connecting together a number of basic atoms where a basic atom is a set of fully interconnected nodes. Key communication characteristics are derived and evaluated for RCC-FULL and efficient routing algorithms, which need only local information to route messages between any two nodes, are also derived. AnO(log (N)) sorting algorithm is shown for RCC-FULL and RCC-FULL is shown to emulate deterministically the CRCW PRAM model, with onlyO(log (N)) degradation in time performance. Finally, the hardware cost for the RCC-FULL is estimated as a function of its pin requirements and compared to that of the binary hypercube and most instances of RCC-FULL have substantially lower cost. Hence, RCC-FULL appears to be a particularly effective network for PRAM emulation, and might be considered as a universal network for future supercomputing systems.

[1]  Selim G. Akl,et al.  Parallel computational geometry , 1992 .

[2]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[3]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[4]  Larry Rudolph,et al.  A Complexity Theory of Efficient Parallel Algorithms , 1990, Theor. Comput. Sci..

[5]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[6]  Allan Borodin,et al.  Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..

[7]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[8]  Richard W. Hall,et al.  An Efficient Class of Interconnection Networks for Parallel Computations , 1994, Comput. J..

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

[10]  Sivarama P. Dandamudi,et al.  Hierarchical Interconnection Networks for Multicomputer Systems , 1990, IEEE Trans. Computers.

[11]  Kurt Mehlhorn,et al.  Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones , 1986, MFCS.

[12]  Eli Upfal,et al.  How to share memory in a distributed system , 1984, JACM.

[13]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[14]  Anthony P. Lucido.  Software Systems for Computer Graphics , 1976, Computer.

[15]  Massimo Maresca,et al.  Polymorphic-Torus Network , 1989, IEEE Trans. Computers.

[16]  Mohan Kumar,et al.  Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes , 1992, IEEE Trans. Parallel Distributed Syst..

[17]  Greg Wilson,et al.  "Past, Present, Parallel": A Survey Of Available Parallel Computer Systems , 1991 .

[18]  VishkinUzi,et al.  Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories , 1984 .

[19]  Russ Miller,et al.  Parallel algorithms for regular architectures - meshes and pyramids , 1996 .

[20]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[21]  Robert Cypher.  Theoretical Aspects of VLSI Pin Limitations , 1993, SIAM J. Comput..

[22]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[23]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[24]  Kai Hwang,et al.  Mapping Neural Networks onto Message-Passing Multicomputers , 1989, J. Parallel Distributed Comput..

[25]  Richard M. Fujimoto,et al.  Multicomputer Networks: Message-Based Parallel Processing , 1987 .

[26]  A Probabilistic Simulation of PRAMs on a Bounded Degree Network , 1988, Inf. Process. Lett..

[27]  Stephan Olariu,et al.  On the Power of Two-Dimensional Processor Arrays with Reconfigurable Bus Systems , 1991, Parallel Process. Lett..

[28]  Richard W. Hall,et al.  Compound Graph Networks for Parallel Image Processing , 1991 .

[29]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[30]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.