[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Multicomputers: Message-Passing Concurrent Computers

Published: 01 August 1988 Publication History

Abstract

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.

References

[1]
1. C.L. Seitz, "The Cosmic Cube," Comm. ACM, Vol. 28, No. 1, Jan. 1985, pp. 22-33.
[2]
2. iPSC/2 brochures and application software reference material, Intel Scientific Computers, Beaverton, Ore., order number 280110-001.
[3]
3. Series 2010 brochures and application software reference material, Ametek Computer Research Division, Monrovia, Calif.
[4]
4. C.L. Seitz, "Concurrent VLSI Architectures," IEEE Trans. Computers, Vol. 33, No. 12, Dec. 1984, pp. 1247-1265.
[5]
5. W.D. Hillis, The Connection Machine, MIT Press, Cambridge, Mass., 1985.
[6]
6. C.L. Seitz, J. Seizovic, and W.-K. Su, "The C Programmer's Abbreviated Guide to Multicomputer Programming," Caltech Computer Sci. Tech. Report 88-1, 1988.
[7]
7. Inmos, The Occam Programming Manual, Prentice-Hall, 1985.
[8]
8. G.A. Agha, Actors: A Model of Concurrent Computation in Distributed Systems, MIT Press, Cambridge, Mass., 1986.
[9]
9. W.C. Athas, "Fine-Grain Concurrent Computation," Caltech Computer Sci. Tech. Report, 5242:TR:87, 1987.
[10]
10. W.J. Dally and C.L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks," IEEE Trans. Computers , Vol. 36, No. 5, May 1987, pp. 547-553.
[11]
11. W. J. Dally, A VLSI Architecture for Concurrent Data Structures, Kluwer Academic Publishers, 1987.
[12]
12. C.M. Flaig, "VLSI Mesh Routing Systems," Caltech Computer Sci. Tech. Report, 5241:TR:87, 1987.

Cited By

View all
  • (2021)User-defined cloudProceedings of the Workshop on Hot Topics in Operating Systems10.1145/3458336.3465304(33-40)Online publication date: 1-Jun-2021
  • (2021)Storage service for edge computingProceedings of the 36th Annual ACM Symposium on Applied Computing10.1145/3412841.3441991(1165-1171)Online publication date: 22-Mar-2021
  • (2019)Optimal Schedule for All-to-All Personalized Communication in Multiprocessor SystemsACM Transactions on Parallel Computing10.1145/33298676:1(1-29)Online publication date: 24-Jun-2019
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Computer
Computer  Volume 21, Issue 8
August 1988
81 pages
ISSN:0018-9162
Issue’s Table of Contents

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 01 August 1988

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 10 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2021)User-defined cloudProceedings of the Workshop on Hot Topics in Operating Systems10.1145/3458336.3465304(33-40)Online publication date: 1-Jun-2021
  • (2021)Storage service for edge computingProceedings of the 36th Annual ACM Symposium on Applied Computing10.1145/3412841.3441991(1165-1171)Online publication date: 22-Mar-2021
  • (2019)Optimal Schedule for All-to-All Personalized Communication in Multiprocessor SystemsACM Transactions on Parallel Computing10.1145/33298676:1(1-29)Online publication date: 24-Jun-2019
  • (2017)An Efficient All Shapes Busy List Processor Allocation Algorithm for 3D Mesh MulticomputersInternational Journal of Cloud Applications and Computing10.4018/IJCAC.20170401027:2(10-26)Online publication date: 1-Apr-2017
  • (2015)Corner-Boundary Processor Allocation for 3D Mesh-Connected MulticomputersInternational Journal of Cloud Applications and Computing10.4018/ijcac.20150101015:1(1-13)Online publication date: 1-Jan-2015
  • (2012)A simple and efficient input selection function for networks-on-chipProceedings of the 13th international conference on Distributed Computing and Networking10.1007/978-3-642-25959-3_39(525-539)Online publication date: 3-Jan-2012
  • (2011)On the Effect of Quantum Interaction Distance on Quantum Addition CircuitsACM Journal on Emerging Technologies in Computing Systems10.1145/2000502.20005047:3(1-17)Online publication date: 1-Aug-2011
  • (2010)Embedding algorithms for bubble-sort, macro-star, and transposition graphsProceedings of the 2010 IFIP international conference on Network and parallel computing10.5555/1882011.1882026(134-143)Online publication date: 13-Sep-2010
  • (2010)An adaptive job scheduling scheme for mesh-connected multicomputersThe Journal of Supercomputing10.1007/s11227-009-0333-253:1(5-25)Online publication date: 1-Jul-2010
  • (2008)Arithmetic on a distributed-memory quantum multicomputerACM Journal on Emerging Technologies in Computing Systems10.1145/1324177.13241793:4(1-23)Online publication date: 28-Jan-2008
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media