Multicomputers: message-passing concurrent computers

A status report is provided on the architecture and programming of a family of concurrent computers that are organized as ensembles of small programmable computers called nodes, connected by a message-passing network, each with its own private memory. The architecture of the multicomputer is described and contrasted with that of the shared-memory multiprocessor, and the concept of grain size (which depends on the size of the individual memories) is explained. Medium-grain and fine-grain multicomputers, with nodes containing megabytes and tens of kilobytes of memory, respectively, are examined, and their programming is discussed.<<ETX>>

[1]  Inmos Corp,et al.  Occam Programming Manual , 1984 .

[2]  G. Edwards Texas , 1958, "These United States".

[3]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[4]  Gul A. Agha,et al.  ACTORS - a model of concurrent computation in distributed systems , 1985, MIT Press series in artificial intelligence.

[5]  Charles M. Flaig VLSI Mesh Routing Systems , 1987 .

[6]  William J. Dally,et al.  A VLSI Architecture for Concurrent Data Structures , 1987 .

[7]  William C. Athas,et al.  Fine Grain Concurrent Computations , 1987 .

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

[9]  Charles L. Seitz,et al.  Concurrent VLSI Architectures , 1984, IEEE Transactions on Computers.

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