Conservative snapshot-based actor garbage collection for distributed mobile actor systems

Wang, Wei-Jen

doi:10.1007/s11235-011-9509-1

Cited by 8 publications

(8 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To avoid pausing executions, Wang and Varela proposed a reference listing based technique called the pseudo-root algorithm. The algorithm computes approximate global snapshots and is implemented in the SALSA runtime [WV06,Wan11]. The pseudo-root algorithm requires a high number of additional control messages and requires actors to write to shared memory if they migrate or release references during snapshot collection.…”

Section: Related Workmentioning

confidence: 99%

A Scalable Algorithm for Decentralized Actor Termination Detection

Plyukhin,

Agha

2021

Preprint

View full text Add to dashboard Cite

Automatic garbage collection (GC) prevents certain kinds of bugs and reduces programming overhead. GC techniques for sequential programs are based on reachability analysis. However, testing reachability from a root set is inadequate for determining whether an actor is garbage: Observe that an unreachable actor may send a message to a reachable actor. Instead, it is sufficient to check termination (sometimes also called quiescence): an actor is terminated if it is not currently processing a message and cannot receive a message in the future. Moreover, many actor frameworks provide all actors with access to file I/O or external storage; without inspecting an actor's internal code, it is necessary to check that the actor has terminated to ensure that it may be garbage collected in these frameworks. Previous algorithms to detect actor garbage require coordination mechanisms such as causal message delivery or nonlocal monitoring of actors for mutation. Such coordination mechanisms adversely affect concurrency and are therefore expensive in distributed systems. We present a low-overhead reference listing technique (called DRL) for termination detection in actor systems. DRL is based on asynchronous local snapshots and message-passing between actors. This enables a decentralized implementation and transient network partition tolerance. The paper provides a formal description of DRL, shows that all actors identified as garbage have indeed terminated (safety), and that all terminated actors-under certain reasonable assumptions-will eventually be identified (liveness).

show abstract

Section: Related Workmentioning

confidence: 99%

A Scalable Algorithm for Decentralized Actor Termination Detection

Plyukhin,

Agha

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…However, the documents on the results of studies and research have the more trustworthy compared with documents from other sources, and is usually directly filtered by various engine indexers such as Scopus, for example [13]. The unofficial documents produced individually, generally junky, a part of them be garbage of information in the Internet [14]. Likewise, the news from newspaper publishers either the softcopy or the hardcopy.…”

Section: A Review and Motivationmentioning

confidence: 99%

A Method to Extract the Forensic about Negative Issues from Web

Nasution

Hardi

Sitepu

et al. 2017

IOP Conf. Ser.: Mater. Sci. Eng.

View full text Add to dashboard Cite

Abstract. In the social world there are many issues: positive or negative. The negative issues affect the level of social comfort. On social media such as Web, every issue positioned based on the document, which has its own attributes, such as the URL address and date of creation. Not easy to extract information from the Web, as well as to determine the origin of an issue that is flowing in the web. This paper is to derive a method for revealing the origin of an issue based on the characteristics of each webpage.

show abstract

“…Garbage collection systems are often presented without soundness proofs [8,9,16,18,[26][27][28]. Where proofs are provided, they often do not address cyclic garbage [24] or mutation [22,23], or require synchronous collection [10].…”

Section: Contributionsmentioning

confidence: 99%

“…This requires write barriers for actor mutation (which requires shared memory and cache coherency), a global synchronisation agent, and coordination of local snapshots within an overlapping time range. These snapshots are used with the pseudo-root algorithm, which additionally requires acknowledgement messages for all asynchronous messages, inverse reference listing, and a multiple-message protocol for reference passing [16][17][18]. Like SALSA 2.0, SALSA 1.0 supports distributed nodes and manual actor migration.…”

Section: Background On Garbage Collection Of Actorsmentioning

confidence: 99%

Fully concurrent garbage collection of actors on many-core machines

Clebsch

Drossopoulou

2013

Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages &Amp; Application

View full text Add to dashboard Cite

Disposal of dead actors in actor-model languages is as important as disposal of unreachable objects in object-oriented languages. In current practice, programmers are required to either manually terminate actors, or they have to rely on garbage collection systems that monitor actor mutation through write barriers, thread coordination through locks etc. These techniques, however, prevent the collector from being fully concurrent.We developed a protocol that allows garbage collection to run fully concurrently with all actors. The main challenges in concurrent garbage collection is the detection of cycles of sleeping actors in the actors graph, in the presence of concurrent mutation of this graph. Our protocol is solely built on message passing: it uses deferred direct reference counting, a dedicated actor for the detection of (cyclic) garbage, and a confirmation protocol (to deal with the mutation of the actor graph).We present our ideas informally through an example, and then present a formal model, prove soundness and argue completeness. We have implemented the protocol as part of a runtime library. As a preliminary performance evaluation, we discuss the performance of our approach as currently used at a financial institution, and use four benchmarks from the literature to compare our approach with other actormodel systems. These preliminary results indicate that the overhead of our approach is small.

show abstract

Conservative snapshot-based actor garbage collection for distributed mobile actor systems

Cited by 8 publications

References 22 publications

A Scalable Algorithm for Decentralized Actor Termination Detection

A Scalable Algorithm for Decentralized Actor Termination Detection

A Method to Extract the Forensic about Negative Issues from Web

Fully concurrent garbage collection of actors on many-core machines

Contact Info

Product

Resources

About