The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems

The Extra Stage Cube (ESC) interconnection network, a fault-tolerant structure, is proposed for use in large-scale parallel and distributed supercomputer systems. It has all of the interconnecting capabilities of the multistage cube-type networks that have been proposed for many supersystems. The ESC is derived from the Generalized Cube network by the addition of one stage of interchange boxes and a bypass capability for two stages. It is shown that the ESC provides fault tolerance for any single failure. Further, the network can be controlled even when it has a failure, using a simple modification of a routing tag scheme proposed for the Generalized Cube. Both one-to-one and broadcast connections under routing tag control are performable by the faulted ESC. The ability of the ESC to operate with multiple faults is examined. The ways in which the ESC can be partitioned and permute data are described.

[1]  Tse-Yun Feng,et al.  Fault-Diagnosis for a Class of Multistage Interconnection Networks , 1981, IEEE Trans. Computers.

[2]  Stephen F. Lundstrom,et al.  Design and Validation of a Connection Network for Many-Processor Multiprocessor Systems , 1981, Computer.

[3]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[4]  Gary J. Nut.  Microprocessor Implementation of a Parallel Processor , 1977, ISCA.

[5]  Kai Hwang,et al.  PUMPS Architecture for Pattern Analysis and Image Database Management , 1982, IEEE Transactions on Computers.

[6]  Samuel H. Fuller,et al.  Cm*: a modular, multi-microprocessor , 1977, AFIPS '77.

[7]  Gary J. Nutt.  A Parallel Processor Operating System Comparison , 1977, IEEE Transactions on Software Engineering.

[8]  Kenneth E. Batcher,et al.  The flip network in staran , 1976 .

[9]  Robert J. McMillen,et al.  The Multistage Cube: A Versatile Interconnection Network , 1981, Computer.

[10]  Michael J. Flynn,et al.  Very high-speed computing systems , 1966 .

[11]  Kuo Yen Wen,et al.  Interprocessor connections--capabilities, exploitation and effectiveness. , 1976 .

[12]  Tse-Yun Feng,et al.  On a Class of Multistage Interconnection Networks , 1980, IEEE Transactions on Computers.

[13]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[14]  William C. McDonald,et al.  The Advanced Data Processing Testbed , 1978, COMPSAC.

[15]  Suchai Thanawastien,et al.  Interference Analysis of Shuffle/Exchange Networks , 1981, IEEE Transactions on Computers.

[16]  Suchai Thanawastien.  The shuffle/exchange-plus networks , 1982, ACM-SE 20.

[17]  Howard Jay Siegel,et al.  A Model of SIMD Machines and a Comparison of Various Interconnection Networks , 1979, IEEE Transactions on Computers.

[18]  Janak H. Patel.  Performance of Processor-Memory Interconnections for Multiprocessors , 1981, IEEE Transactions on Computers.

[19]  Svetlana P. Kartashev,et al.  A Multicomputer System with Dynamic Architecture , 1979, IEEE Transactions on Computers.

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

[21]  G. Jack Lipovski,et al.  Design and implementation of the banyan interconnection network in TRAC , 1980, AFIPS '80.

[22]  Howard Jay Siegel,et al.  PASM: A Partitionable SIMD/MIMD System for Image Processing and Pattern Recognition , 1981, IEEE Transactions on Computers.

[23]  Howard Jay Siegel,et al.  Study of multistage SIMD interconnection networks , 1978, ISCA '78.

[24]  Howard Jay Siegel,et al.  Many SIMD interconnection networks have been proposed . To put the different approaches into perspective , this analysis compares a number of single-and multistage networks , 2022 .

[25]  Jack B. Dennis,et al.  Building blocks for data flow prototypes , 1980, ISCA '80.

[26]  Howard Jay Siegel,et al.  Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address Masks , 1977, IEEE Transactions on Computers.

[27]  Howard Jay Siegel.  The Theory Underlying the Partitioning of Permutation Networks , 1980, IEEE Transactions on Computers.