During the period following the completion of the Cosmic Cube experiment [1], and while commercial descendants of this first-generation multicomputer (message-passing concurrent computer) were spreading through a community that includes many of the attendees of this conference, members of our research group were developing a set of ideas about the physical design and programming for the second generation of medium-grain multicomputers.
Our principal goal was to improve by as much as two orders of magnitude the relationship between message-passing and computing performance, and also to make the topology of the message-passing network practically invisible. Decreasing the communication latency relative to instruction execution times extends the application span of multicomputers from easily partitioned and distributed problems (eg, matrix computations, PDE solvers, finite element analysis, finite difference methods, distant or local field many-body problems, FFTs, ray tracing, distributed simulation of systems composed of loosely coupled physical processes) to computing problems characterized by “high flux” [2] or relatively fine-grain concurrent formulations [3, 4] (eg, searching, sorting, concurrent data structures, graph problems, signal processing, image processing, and distributed simulation of systems composed of many tightly coupled physical processes). Such applications place heavy demands on the message-passing network for high bandwidth, low latency, and non-local communication. Decreased message latency also improves the efficiency of the class of applications that have been developed on first-generation systems, and the insensitivity of message latency to process placement simplifies the concurrent formulation of application programs.
Our other goals included a streamlined and easily layered set of message primitives, a node operating system based on a reactive programming model, open interfaces for accelerators and peripheral devices, and node performance improvements that could be achieved economically by using the same technology employed in contemporary workstation computers.
By the autumn of 1986, these ideas had become sufficiently developed, molded together, and tested through simulation to be regarded as a complete architectural design. We were fortunate that the Ametek Computer Research Division was ready and willing to work with us to develop this system as a commercial product. The Ametek Series 2010 multicomputer is the result of this joint effort.
[1]
Leonard Kleinrock,et al.
Virtual Cut-Through: A New Computer Communication Switching Technique
,
1979,
Comput. Networks.
[2]
Charles L. Seitz,et al.
The C Programmer''s Abbreviated Guide to Multicomputer Programming
,
1987
.
[3]
Charles M. Flaig.
VLSI Mesh Routing Systems
,
1987
.
[4]
William C. Athas,et al.
Fine Grain Concurrent Computations
,
1987
.
[5]
William J. Dally,et al.
A VLSI Architecture for Concurrent Data Structures
,
1987
.
[6]
JEFFREY D. ULLMAN,et al.
Flux, Sorting, and Supercomputer Organization for AI Applications
,
1984,
J. Parallel Distributed Comput..
[7]
Charles L. Seitz,et al.
The cosmic cube
,
1985,
CACM.