MULTILISP: a language for concurrent symbolic computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent object-oriented real-times systems research
OOPSLA/ECOOP '88 Proceedings of the 1988 ACM SIGPLAN workshop on Object-based concurrent programming
Object-oriented programming in Ada83—genericity rehabilitated
ACM SIGAda Ada Letters
A bibliography on garbage collection and related topics
ACM SIGPLAN Notices
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
A real-time garbage collector based on the lifetimes of objects
Communications of the ACM
Combinatorially implosive algorithms
Communications of the ACM
Composable Semantic Models for Actor Theories
Higher-Order and Symbolic Computation
Overview of a Parallel Object-Oriented Language CLIX
ECOOP '87 Proceedings of the European Conference on Object-Oriented Programming
The MuNet: A scalable decentralized architecture for parallel computation
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Implementation of multilisp: Lisp on a multiprocessor
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
The Apiary network architecture for knowledgeable systems
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
An actor-based programming system
Proceedings of the SIGOA conference on Office information systems
A new approach to parallelising tracing algorithms
Proceedings of the 2009 international symposium on Memory management
| Hi-index | 0.03 |
Actor theory was invented by Hewitt and collaborators as a synthesis of many of the ideas from the high-level languages LISP, GEDANKEN, SMALLTALK, SIMULA-67, and others. Actor theory consists of a group of active objects called Actors, which communicate by passing messages to one another. This thesis explores several problems associated with implementing Actor theory as a basis for computer systems design. First, we give a firmer foundation to the theory by setting forth axioms which must be satisfied by any physically realizable message passing system. We then give an operational semantics for this theory by exhibiting an interpreter which is mapping this conceptual system onto current hardware in such a way that simple primitive operations all take a (small) bounded amount of time. In particular, the issues of storage and processor management are investigated and a real-time incremental garbage collection system for both is exhibited and analyzed. {AD A053-328}