Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
Concurrent programming in ERLANG (2nd ed.)
Concurrent programming in ERLANG (2nd ed.)
Garbage collecting the Internet: a survey of distributed garbage collection
ACM Computing Surveys (CSUR)
A real-time garbage collector based on the lifetimes of objects
Communications of the ACM
List processing in real time on a serial computer
Communications of the ACM
Using passive object garbage collection algorithms for garbage collection of active objects
Proceedings of the 3rd international symposium on Memory management
Introduction to Algorithms
Programming dynamically reconfigurable open systems with SALSA
ACM SIGPLAN Notices
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Actor frameworks for the JVM platform: a comparative analysis
PPPJ '09 Proceedings of the 7th International Conference on Principles and Practice of Programming in Java
Distributed garbage collection for mobile actor systems: the pseudo root approach
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Fully concurrent garbage collection of actors on many-core machines
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Hi-index | 0.00 |
Large-scale distributed computing applications require concurrent programming models that support modular and compositional software development The actor model supports the development of independent software components with its asynchronous message-passing communication and state encapsulation properties Automatic actor garbage collection is necessary for high-level actor-oriented programming, but identifying live actors is not as intuitive and easy as identifying live passive objects in a reference graph However, a transformation method can turn an actor reference graph into a passive object reference graph, which enables the use of passive object garbage collection algorithms and simplifies the problem of actor garbage collection In this paper, we formally define potential communication by introducing two binary relations - the may-talk-to and the may-transitively-talk-to relations, which are then used to define the set of live actors We also devise two vertex-preserving transformation methods to transform an actor reference graph into a passive object reference graph We provide correctness proofs for the proposed algorithms The experimental results also show that the proposed algorithms are efficient.