Abstract
A foundational model of concurrency is developed in this thesis. It examines issues in the design of parallel systems and show why the actor model is suitable for exploiting large-scale parallelism. Concurrency in actors is constrained only by the availability of hardware resources and by the logical dependence inherent in the computation. Unlike dataflow and functional programming, however, actors are dynamically reconfigurable and can model shared resources with changing local state. Concurrency is spawned in actors using asynchronous message-passing, pipelining, and the dynamic creation of actors. The author defines an abstract actor machine and provide a minimal programming language for it. A more expressive language, which includes higher level constructs such as delayed and eager evaluation, can be defined in terms of the primitives. Examples are given to illustrate the ease with which concurrent data and control structures can be programmed. This thesis deals with some central issues in distributed computing. Specifically, problems of divergence and deadlock are addressed. Additional keywords: Object oriented programming; Semantics.
Keywords
Affiliated Institutions
Related Publications
Incremental, iterative data processing with timely dataflow
We describe the timely dataflow model for distributed computation and its implementation in the Naiad system. The model supports stateful iterative and incremental computations....
Dynamic graphics using quasi parallelism
Dynamic computer graphics is best represented as several processes operating in parallel. Full parallel processing, however, entails much complex mechanism making it difficult t...
Computer animation with scripts and actors
A technique and philosophy for controlling computer animation is discussed. Using the Actor/Scriptor Animation System (ASAS) a sequence is described by the animator as a formal ...
Revolutionizing Supply Chain Management: Real-time Data Processing and Concurrency
In the contemporary business landscape, effective supply chain management (SCM) is paramount for organizations seeking to thrive amidst evolving market dynamics and heightened c...
OpenMP: an industry standard API for shared-memory programming
At its most elemental level, OpenMP is a set of compiler directives and callable runtime library routines that extend Fortran (and separately, C and C++ to express shared memory...
Publication Info
- Year
- 1986
- Type
- book
- Citations
- 2231
- Access
- Closed