Proceedings of the IEEE · 1989 · 134 citations · 30 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureInterconnection NetworksParallel ComputingDistributed ComputingDistributed Memory SystemsHypercube NetworksParallel ArchitecturesParallel Computer ArchitectureParallel Computing SystemsDistributed MemoryHigh-performance Computing SystemsHypercube InterconnectsHypercube Network ConnectivityHypercube Network RoutingHypercube TopologyParallel Computing InterconnectsSupercomputer Architecture
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
30
Generative communication in Linda
David Gelernter · ACM Transactions on Programming Languages and Systems · 1985 · 2.3K citations · Full text
Branch-and-Bound Methods: A Survey
Eugene L. Lawler, Derek Wood · Operations Research · 1966 · 2K citations
John L. Gustafson · Communications of the ACM · 1988 · 1.4K citations · Full text
Charles L. Seitz · Communications of the ACM · 1985 · 1.2K citations · Full text