• Corpus ID: 8988447

ACTORS - a model of concurrent computation in distributed systems

@inproceedings{Agha1985ACTORSA,
  title={ACTORS - a model of concurrent computation in distributed systems},
  author={Gul A. Agha},
  booktitle={MIT Press series in artificial intelligence},
  year={1985}
}
  • G. Agha
  • Published in
    MIT Press series in…
    1985
  • Computer Science
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… 
THAL: An Actor System For Efficient and Scalable Concurrent Computing
TLDR
Experiments on a stock-hardware distributed memory multicomputer (CM-5) show that the compiler and the runtime system yield efficiency and scalability on applications with sufficiently large granularity which are comparable to the performance of other less flexible systems.
The Structure and Semantics of Actor Languages
  • G. Agha
  • Computer Science
    REX Workshop
  • 1990
TLDR
An abstract view of actor computations in terms of event diagrams and the laws of concurrent computing is provided and how delayed evaluation, streams, continuations, higher-order functions, and other structures, can be built in Terms of actor languages are illustrated.
Synchronization views for event-loop actors
The actor model has already proven itself as an interesting concurrency model that avoids issues such as deadlocks and race conditions by construction, and thus facilitates concurrent programming.
Domains: safe sharing among actors
TLDR
The solution proposes domains and synchronization views to solve the issues without compromising on the semantic properties of the actor model and the resulting concurrency model maintains deadlock-freedom and avoids low-level race conditions.
Linguistic paradigms for programming complex distributed systems
TLDR
The goal of the research is to find the right set of abstractions for building complex distributed systems by abstracting over patterns of interactions between actors.
Tanks: multiple reader, single writer actors
TLDR
A variation on the communicating event-loops actor model called the TANK model is introduced, which ensures that any other actor will always observe a consistent version of that state, even in the face of concurrent updates of the actor that owns that state.
Actor Model of Computation: Scalable Robust Information Systems
TLDR
The Actor Model is intended to provide a foundation for inconsistency robust information integration for all kinds of digital information for individuals, groups, and organizations so their information usefully links together.
MP: an application specific concurrent language
TLDR
The defininition, and implementation of a concurrent language mp (Message Passer), which is aimed at programming embedded multi micro-processor systems, and the provision of simple restricted concurrency constructs that make such systems modular and deadlock free.
Foundational issues in concurrent computing
  • G. Agha
  • Computer Science
    OOPSLA/ECOOP '88
  • 1988
TLDR
The actor model, in its current form [1], captures the essence of concurrent computation in distributed systems at an abstract level.
Typed concurrent functional programming with channels, actors and sessions
TLDR
This thesis provides the first integration of exception handling and asynchronous session types in a core functional language, Exceptional GV, and proves that it satis es preservation, global progress, and that it is con uent and terminating.
...
...

References

SHOWING 1-10 OF 43 REFERENCES
Synchronization in actor systems
TLDR
It is shown for some simple examples that serializers represent a step toward better structuring of parallel access to shared resources, and that proofs that starvation is impossible for these examples are easier with serializers than with some of the currently existing mechanisms for controlling parallelAccess to resources.
A Model for Communicating Sequential Processes
  • C. Hoare
  • Computer Science
    On the Construction of Programs
  • 1980
TLDR
A semantic model for processes based on failures is defined, which encapsulate certain finite aspects of process behaviour and allow an elegant treatment of nondeterminism, and a set of process operations are defined, including nondeterministic choice, conditional composition, and various forms of' parallel composition.
A formal model of non-determinate dataflow computation
TLDR
A formal model of computation for non-determinate networks is presented in which each possible computation of a network is represented by a scenario, and it is proved that the correctness of the model is consistency with the standard operational model of dataflow computation.
Semantic Considerations in the Actor Paradigm of Concurrent Computation
  • G. Agha
  • Computer Science
    Seminar on Concurrency
  • 1984
TLDR
A new formalism is developed to describe the behavior of actors and the evolution of systems of actors, called Sal, which has a simple syntax but nevertheless embodies the concepts involved.
Actors and Continuous Functionals
TLDR
This paper presents precise versions of some "laws" that must be satisfied by computations involving communicating parallel processes, intended to be applied to the design and analysis of systems consisting of large numbers of physical processors.
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs
TLDR
A new class of computing systems uses the functional programming style both in its programming language and in its state transition rules; these systems have semantics loosely coupled to states—only one state transition occurs per major computation.
Laws for Communicating Parallel Processes
TLDR
This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology on parallel processes, parallel or asynchronous computations, partial orders of events, Actor theory.
Analyzing the Roles of Descriptions and Actions in Open Systems
TLDR
It is concluded that descriptions and actions complement one another; neither being sufficient unto itself in large scale, open ended, geographically distributed, concurrent systems.
...
...