A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Diffusion tree restructuring for indirect reference counting
2001
SIGPLAN notices
Preserved Fulltext
The new variant exploits standard mechanisms for implementing di usion trees and remote references, using four simple low-cost techniques to dynamically restructure the trees to reduce their depth. ...
A new variant algorithm for distributed acyclic garbage detection is presented for use in hybrid garbage collectors. ...
Section 2 presents background material on: the problems posed by distributed reference counting; the IRC algorithm; the low-level implementation of remote references; and the construction and maintenance ...
doi:10.1145/362426.362485
fatcat:xw3nzqpy5zhz3mt5qgyrj2ywqi
Diffusion tree restructuring for indirect reference counting
2000
Proceedings of the second international symposium on Memory management - ISMM '00
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The new variant exploits standard mechanisms for implementing di usion trees and remote references, using four simple low-cost techniques to dynamically restructure the trees to reduce their depth. ...
A new variant algorithm for distributed acyclic garbage detection is presented for use in hybrid garbage collectors. ...
Section 2 presents background material on: the problems posed by distributed reference counting; the IRC algorithm; the low-level implementation of remote references; and the construction and maintenance ...
doi:10.1145/362422.362485
dblp:conf/iwmm/Dickman00
fatcat:6idbtdtaa5arli4vmp7lcxt2jm
Lazy reference counting for the microgrid
2012
2012 16th Workshop on Interaction between Compilers and Computer Architectures (INTERACT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This papers revisits non-deferred reference counting, a common technique to ensure that potentially shared large heap objects can be reused safely when they are both input and output to computations. ...
Traditionally, thread-safe reference counting exploit implicit memory-based communication of counter data and require means to achieve a globally consistent memory state, either using barriers or locks ...
Acknowledgements The research was performed at the School of Computer Science, University of Hertfordshire, UK, and the Institute for Informatics, University of Amsterdam, NL, under EU research grant FP7 ...
doi:10.1109/interact.2012.6339625
dblp:conf/IEEEinteract/PossGHS12
fatcat:wk6y7y5nr5cevhyhdifxbgltxu
Garbage collecting the Internet: a survey of distributed garbage collection
1998
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
This taxonomy is used as a framework to explore distribution issues: locality of action, communication overhead and indeterministic communication latency. ...
The spectrum of garbage-collection schema for linked structures distributed over a network are reviewed here. ...
ACKNOWLEDGMENT The authors are grateful to the referees for pointing out omissions and misconceptions in the draft. ...
doi:10.1145/292469.292471
fatcat:odrr35rx4jfyvihpguawcljqv4
Pay Migration Tax to Homeland: Anchor-based Scalable Reference Counting for Multicores
2019
USENIX Conference on File and Storage Technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
One of the culprits behind performance degradation is reference counting widely used for managing data and metadata, and scalability is badly impacted under load with little or no logical contention, where ...
To address this, we propose PAYGO, a reference counting technique that combines per-core hash of local reference counters with an anchor counter. ...
Computing), and (2016-0-00023, National Program for Excellence in SW) supervised by the Institute for Information and communications Technology Promotion (IITP), Korea. ...
dblp:conf/fast/JungKRKJ19
fatcat:3n37mujld5btlmqqjhy6hhekfq
Incremental distribution of timestamp packets: a new approach to distributed garbage collection
1989
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Computational and network communication overhead are acceptable. Hosts may be temporarily inaccessible and synchronization between hosts is not necessary. ...
This algorithm collects distributed garbage incrementally and concurrently with user activity. It is the first incremental algorithm that is capable of collecting cyclic distributed garbage. ...
Cl Communication between hosts for garbage collection purposes is minimal and computational overhead is acceptable. ...
doi:10.1145/74878.74883
fatcat:oqgjs6lrujckxbtiwxqifs4etq
D'Caml: Native Support for Distributed ML Programming in Heterogeneous Environment
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The distributed garbage collector reclaims unused distributed data-structures. Examples demonstrate expressivity of higher-order distributed programming using Distributed Caml. ...
The distributed shared memory allows transmission and sharing of arbitrary ML objects including higher-order functions, exceptions, and mutable objects without affecting the sequential semantics of ML. ...
The distributed garbage collection mechanism is based on a variant of reference counting algorithm called weighted reference counting (WRC) [3] . ...
doi:10.1007/3-540-48311-x_127
fatcat:qnuemep675cbffsvzl7dzisb7m
System Description for a Scalable, Fault-Tolerant, Distributed Garbage Collector
[article]
2002
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We describe an efficient and fault-tolerant algorithm for distributed cyclic garbage collection. ...
The algorithm imposes few requirements on the local machines and allows for flexibility in the choice of local collector and distributed acyclic garbage collector to use with it. ...
A solution is to use reference counting for collecting acyclic garbage and a tracing algorithm for collecting cyclic garbage. ...
arXiv:cs/0207036v1
fatcat:adxou2ye3zeadnz7fwa7jdqhdi
A cyclic distributed garbage collector for network objects
[chapter]
1996
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The algorithm is based on a reference listing scheme, which i s augmented by partial tracing in order to collect distributed garbage cycles. ...
This paper presents an algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. ...
In contrast, distributed reference counting algorithms have the advantages for large-scale systems of ne interleaving with mutators, and locality of reference (and hence low communication costs). ...
doi:10.1007/3-540-61769-8_9
fatcat:2qmztno72vcajeii5e7ugria6a
X10 and APGAS at Petascale
2014
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
poor fit for APGAS today Memory Management § Garbage collector § problem: distributed heap § distributed garbage collection is impractical § solution: segregate local/remote refs ! ...
è CGO tutorial § resilience and elasticity è next talk § X10 is § a programming language § imperative object-oriented strongly-typed garbage-collected (like Java) § concurrent and distributed: ...
doi:10.1145/2555243.2555245
dblp:conf/ppopp/TardieuHCGKSSTV14
fatcat:kyw5snbvu5abjlk2eehtdx74ge
X10 and APGAS at Petascale
2014
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
poor fit for APGAS today Memory Management § Garbage collector § problem: distributed heap § distributed garbage collection is impractical § solution: segregate local/remote refs ! ...
è CGO tutorial § resilience and elasticity è next talk § X10 is § a programming language § imperative object-oriented strongly-typed garbage-collected (like Java) § concurrent and distributed: ...
doi:10.1145/2692916.2555245
fatcat:l57fpwlkyjciti4frjljsljhs4
Collecting cyclic distributed garbage by controlled migration
1997
Distributed computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2001; you can also visit the original URL.
The file type is application/pdf.
The scheme has low overhead, and it preserves the decentralized and fault-tolerant nature of distributed reference counting and migration. ...
Distributed reference counting provides timely and faulttolerant garbage collection in large distributed systems, but it fails to collect cyclic garbage distributed across nodes. ...
Acknowledgments The authors are grateful to Miguel Castro, Raymie Stata, James O'Toole, and the referees for their comments. ...
doi:10.1007/s004460050026
fatcat:mfpqfhbtfregnd5xvtvvxwdz34
Collecting cyclic distributed garbage by controlled migration
1995
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2001; you can also visit the original URL.
The file type is application/pdf.
The scheme has low overhead, and it preserves the decentralized and fault-tolerant nature of distributed reference counting and migration. ...
Distributed reference counting provides timely and faulttolerant garbage collection in large distributed systems, but it fails to collect cyclic garbage distributed across nodes. ...
Acknowledgments The authors are grateful to Miguel Castro, Raymie Stata, James O'Toole, and the referees for their comments. ...
doi:10.1145/224964.224971
dblp:conf/podc/MaheshwariL95
fatcat:xn57qql7lbgxfbznuz7zevnbai
Cyclic distributed garbage collection with group merger
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
The algorithm is based on a reference listing scheme augmented by partial tracing in order to collect distributed garbage cycles. ...
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. ...
In contrast, distributed reference counting algorithms have the advantages for large-scale systems of fine interleaving with mutators, and locality of reference (and hence low communication costs). ...
doi:10.1007/bfb0054095
fatcat:zzkydq4xavgxhhhjwsj4wlaejy
Asynchronous Complete Garbage Collection for Graph Data Stores
2015
Proceedings of the 16th Annual Middleware Conference on - Middleware '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a novel Garbage Collection (GC) algorithm that safely eliminates both acyclic and cyclic garbage with support for replicated data. ...
Such data stores typically support both distribution and replication of vertexes across physical nodes. ...
This work was supported by national funds through Fundação para a Ciência e a Tecnologia with reference UID/CEC/50021/2013. ...
doi:10.1145/2814576.2814813
dblp:conf/middleware/VeigaBF15
fatcat:nxseep7fivdqribdxhsohmyzqq
« Previous
Showing results 1 — 15 out of 2,628 results