Skip to main content

Mosaic C: An experimental fine-grain multicomputer

  • I. Parallel Processing, Databases, Networks, and Distributed Systems
  • Conference paper
  • First Online:
Future Tendencies in Computer Science, Control and Applied Mathematics (INRIA 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 653))

Included in the following conference series:

Abstract

Commercial medium-grain multicomputers aimed at ultra-supercomputer performance are pursuing a less profitable scaling track than fine-grain multicomputers. The Caltech Mosaic C is an experimental, fine-grain multicomputer that employs single-chip nodes and advanced packaging technology to demonstrate the performance/cost advantages of the fine-grain-multicomputer architecture. Each Mosaic node includes 64KB of memory, an 11MIPS processor, a packet interface, and a router. The nodes are tied together with a 60MBytes/s, two-dimensional, routing-mesh network. The compilation-based programming system allows fine-grain, reactive-process, message-passing programs to be expressed in an extension of C++, and the runtime system performs automatic, distributed management of system resources. Mosaic components and programming tools have already been used by another project to implement the 400Mbits/s ATOMIC local-area network, and a 16K-node machine is under construction at Caltech to explore the programmability and application span of the architecture for large-scale computing problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tom Alexander, “How to Stop Fearing and Start Loving the Parallel Computer,” NSF Mosaic, pp. 2–11, Spring 1992, National Science Foundation.

    Google Scholar 

  2. Gordon Bell, “Ultracomputers: A Teraflop Before Its Time,” CACM, 35(8): 26–47, August 1992.

    Google Scholar 

  3. Nanette J. Boden, “Runtime Systems for Fine-Grain Multicomputers,” Caltech Computer Science PhD thesis forthcoming; publication expected December 1992.

    Google Scholar 

  4. H. T. Kung and Charles L. Leiserson, “Algorithms for VLSI Processor Arrays,” Section 8.3 in Introduction to VLSI Systems by Carver A. Mead and Lynn A. Conway, Addison-Wesley, 1980.

    Google Scholar 

  5. Michael J. Pertel, “A Critique of Adaptive Routing,” Caltech Computer Science Technical Report Caltech-CS-TR-92-06, 1992.

    Google Scholar 

  6. Michael J. Pertel, “The Optimal Dimension for Multicomputer Routing Networks,” Caltech Computer Science Technical Report Caltech-CS-TR-92-09, 1992.

    Google Scholar 

  7. Charles L. Seitz, “The Cosmic Cube,” CACM, 28(1): 22–33, January 1985.

    MathSciNet  Google Scholar 

  8. Charles L. Seitz, Jakov Seizovic, Wen-King Su, “The C Programmer's Abbreviated Guide to Multicomputer Programming,” Caltech Computer Science Technical Report Caltech-CS-TR-88-1, 1988.

    Google Scholar 

  9. Charles L. Seitz, “Multicomputers,” Chapter five in Developments in Concurrency and Communication, edited by C. A. R. Hoare, Addison-Wesley, 1990.

    Google Scholar 

  10. Charles L. Seitz, “Concurrent Computation and Programming,” Chapter one in VLSI and Parallel Computation, edited by Roberto Suaya and Graham Birtwistle, Morgan Kaufmann Publishers, 1990.

    Google Scholar 

  11. Jakov Seizovic, “The Architecture and Programming of a Fine-Grain Multi-computer,” Caltech Computer Science PhD thesis forthcoming; publication expected June 1993.

    Google Scholar 

  12. Wen-King Su, “Reactive-Process Programming and Distributed Discrete-Event Simulation,” Caltech Computer Science Technical Report Caltech-CS-TR-89-11, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

A. Bensoussan J. -P. Verjus

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seitz, C.L. (1992). Mosaic C: An experimental fine-grain multicomputer. In: Bensoussan, A., Verjus, J.P. (eds) Future Tendencies in Computer Science, Control and Applied Mathematics. INRIA 1992. Lecture Notes in Computer Science, vol 653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56320-2_53

Download citation

  • DOI: https://doi.org/10.1007/3-540-56320-2_53

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56320-4

  • Online ISBN: 978-3-540-47520-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics