Universal mechanisms for concurrency

  • William J. Dally
  • D. Scott Wills
Invited Lectures

DOI: 10.1007/3540512845_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 365)
Cite this paper as:
Dally W.J., Wills D.S. (1989) Universal mechanisms for concurrency. In: Odijk E., Rem M., Syre JC. (eds) PARLE '89 Parallel Architectures and Languages Europe. PARLE 1989. Lecture Notes in Computer Science, vol 365. Springer, Berlin, Heidelberg

Abstract

We propose a machine model consisting of a set of primitive mechanisms for communication, synchronization, and naming. These mechanisms have been selected as a compromise between what can easily be implemented in hardware and what is required to support parallel models of computation. Implementations of three models of parallel computation: actors, dataflow, and shared-memory using this model are sketched. The costs of the mechanisms on a particular parallel machine are presented and issues involved in implementing the model are discussed. Identifying a primitive set of mechanisms separates issues of programming models from issues of machine organization. Problems are partitioned into those involving implementation of the primitive mechanisms and those involving implementation of programming models and systems using the mechanisms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • William J. Dally
    • 1
  • D. Scott Wills
    • 1
  1. 1.Artificial Intelligence Laboratory Laboratory for Computer ScienceMassachusetts Institute of TechnologyCambridge

Personalised recommendations