1989•Proceedings of the IEEERequires access

Hypercube supercomputers

John P. Hayes, Trevor Mudge

Abstract

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.>

About this research paper

What this paper is about

Why it matters

OpenAlex reports 135 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Hypercube, Computer science, Embedding, Parallel computing, Class (philosophy), Interconnection, Code (set theory), Routing (electronic design automation)