Hypercube supercomputers

The architecture and applications of the class of highly parallel distributed-memory multiprocessors based on the hypercube interconnection structure are surveyed. The history of hypercube computers from their conceptual origins in the 1960s to the recent introduction of commercial machines is briefly reviewed. The properties of hypercube graphs relevant to their use in supercomputers, including connectivity, routing, and embedding, are examined. The hardware and software characteristics of current hypercubes are discussed, with emphasis on the unique aspects of their operating systems and programming languages. A sample C program is presented to illustrate the single-code, multiple-data programming style typical of distributed-memory machines in general, and hypercube applications in particular. Two contrasting hypercube applications are presented and analyzed: image processing and branch-and-bound optimization. Current trends are discussed. >

[1]  Trevor N. Mudge,et al.  Vision Algorithms for Hypercube Machines , 1987, J. Parallel Distributed Comput..

[2]  E. W. Felten,et al.  Chess on a hypercube , 1988, C3P.

[3]  M. Livingston,et al.  Embeddings in hypercubes , 1988 .

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

[5]  Robert E. Benner,et al.  Development of Parallel Methods for a $1024$-Processor Hypercube , 1988 .

[6]  David Gelernter,et al.  Generative communication in Linda , 1985, TOPL.

[7]  Peter J. Denning.  parallel computing and its evolution , 1986 .

[8]  James F. Korsh,et al.  A General Algorithm for One-Dimensional Knapsack Problems , 1977, Oper. Res..

[9]  Theodore R. Bashkow,et al.  A large scale, homogeneous, fully distributed parallel machine, I , 1977, ISCA '77.

[10]  F. Harary,et al.  A survey of the theory of hypercube graphs , 1988 .

[11]  John L. Gustafson,et al.  Reevaluating Amdahl's law , 1988, CACM.

[12]  Jon S. Squire,et al.  Physical and logical design of a highly parallel computer : technical note , 1962 .

[13]  Dirk Grunwald,et al.  Hyperswitch network for the hypercube computer , 1988, ISCA '88.

[14]  Howard Jay Siegel,et al.  Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.) , 1985 .

[15]  T. N. Mudge,et al.  Parallel branch and bound algorithms on hypercube multiprocessors , 1989, C3P.

[16]  T. Mudge,et al.  Ada on a hypercube , 1989, ALET.

[17]  Jon S. Squire,et al.  Programming and design considerations of a highly parallel computer , 1963, AFIPS '63 (Spring).

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

[19]  Kevin P. McAuliffe,et al.  The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture , 1985, ICPP.

[20]  Kai Hwang.  Advanced parallel processing with supercomputer architectures , 1987, Proceedings of the IEEE.

[21]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[22]  John C. Peterson,et al.  The Mark III Hypercube-Ensemble Concurrent Computer , 1985, International Conference on Parallel Processing.

[23]  John P. Hayes,et al.  A Microprocessor-based Hypercube Supercomputer , 1986, IEEE Micro.

[24]  Trevor Mudge,et al.  Parallel processing of best-first branch and bound algorithms on distributed memory multiprocessors , 1989 .

[25]  Ronald H. Perrott,et al.  Parallel programming , 1988, International computer science series.

[26]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[27]  Vipin Kumar,et al.  A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures , 1983, Artif. Intell..

[28]  John C. Peterson,et al.  Caltech/JPL MARK II Hypercube Concurrent Processor , 1985, ICPP.

[29]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[30]  G. C. Fox,et al.  Solving Problems on Concurrent Processors , 1988 .

[31]  Frank Harary,et al.  Graph Theory , 2016 .

[32]  Trevor Mudge,et al.  Monte Carlo Photon Transport On Shared Memory and Distributed Memory Parallel Processors , 1987 .

[33]  J. P. Hayes,et al.  On allocating subcubes in a hypercube multiprocessor , 1988, C3P.

[34]  Robert H. Thomas,et al.  Performance Measurements on a 128-Node Butterfly Parallel Processor , 1985, ICPP.

[35]  David May,et al.  A Tutorial Introduction To Occam Programming , 1987 .

[36]  Gregory Dean Buzzard.  High performance communications for hypercube multiprocessors , 1988 .

[37]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.