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
Garbage collection in object-oriented databases using transactional cyclic reference counting
1998
The VLDB journal
Preserved Fulltext
In this paper, we present a garbage collection algorithm, called Transactional Cyclic Reference Counting (TCRC), for object oriented databases. ...
Garbage collection is important in objectoriented databases to free the programmer from explicitly deallocating memory. ...
Acknowledgments We t,hank Jeff Naughton and Jie-bing Yu for giving us a version of their garbage collection code which provided us insight into garbage collection implementation. ...
doi:10.1007/s007780050062
fatcat:pd7pqrfsarch3if6nqpp6mblsa
Partitioned garbage collection of a large object store
1997
Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97
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.
This paper describes a new garbage collection scheme for large persistent object stores that makes efficient use of the disk and main memory. ...
The heap is divided into partitions that are collected independently using information about inter-partition references. ...
Implementation We are implementing partitioned garbage collection in the context of Thor, an object-oriented database. ...
doi:10.1145/253260.253338
dblp:conf/sigmod/MaheshwariL97
fatcat:cbqhxljgirgklevz5vbqit4yte
Partitioned garbage collection of a large object store
1997
SIGMOD record
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.
This paper describes a new garbage collection scheme for large persistent object stores that makes efficient use of the disk and main memory. ...
The heap is divided into partitions that are collected independently using information about inter-partition references. ...
Implementation We are implementing partitioned garbage collection in the context of Thor, an object-oriented database. ...
doi:10.1145/253262.253338
fatcat:44etq26uqjalpg5vctvp36te44
A highly effective partition selection policy for object database garbage collection
1998
IEEE Transactions on Knowledge and Data Engineering
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 2007; you can also visit the original URL.
The file type is application/pdf.
We evaluate how different application, database system, and garbage collection implementation parameters affect the performance of garbage collection in object database systems. ...
We focus specifically on investigating the policy that is used to select which partition in the database should be collected. ...
This work was supported, in part, by the National Science Foundation under Grant No. IRI-95-21046. ...
doi:10.1109/69.667100
fatcat:ot7bfprvbzgsrkfe75nunp6lga
Deferred gratification
2011
Proceedings of the 2011 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness - MSPC '11
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 2012; you can also visit the original URL.
The file type is application/pdf.
A common trap is to punt on the design and engineering of exact garbage collection and instead opt for reference counting or conservative garbage collection (GC). ...
Because reference counting is incomplete, the implementors must (a) also implement tracing to detect cyclic garbage, or (b) prohibit cyclic data structures, or (c) never reclaim cyclic garbage. ...
Acknowledgements We thank Andi Gutmans and Zeev Suraski, co-creators of PHP 3 and the Zend Engine, and Dmitry Stogov of Zend Technologies Ltd. for their assistance, particularly with the PHP benchmarks in ...
doi:10.1145/1988915.1988930
dblp:conf/pldi/JibajaBHM11
fatcat:g7z5fpmgefhe7odxo3jhnfvk3a
Garbage collection for a client-server persistent object store
1999
ACM Transactions on Computer Systems
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.
We describe an efficient server-based algorithm for garbage collecting persistent object stores in a client-server environment. ...
The algorithm is incremental and runs concurrently with client transactions. Unlike previous algorithms, it does not hold any transactional locks on data and does not require callbacks to clients. ...
An early version of the collector is used in version 4.6 of O 2 . 9.1.5 Transactional Cyclic Reference Counting. ...
doi:10.1145/320656.322741
fatcat:3hny6o3w5rgadehj7da3yqb25m
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.
Cyclic garbage is difficult to detect and many algorithms fail Marcel Sc helvis in this respect. Abstract A new algorithm for distributed garbage collection is presented. ...
tion algorithm is that it should collect all objects that Distributed Garbage Collection are dead, and only those objects that are dead. ...
Bevan, Distributed Garbage Collection Using Reference Counts, Parallel Architectures and Languages Europe Conference Proceedings Vol. ...
doi:10.1145/74878.74883
fatcat:oqgjs6lrujckxbtiwxqifs4etq
Online reorganization of databases
2009
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 2017; you can also visit the original URL.
The file type is application/pdf.
to newly allocated storage (as opposed to reorganizing in place), use of differential files, references to data that has moved, performance, and activation of reorganization. ...
This category includes restoration of clustering, reorganization of an index, rebalancing of parallel or distributed data, garbage collection for persistent storage, and cleaning (reclamation of space) ...
The authors supplement their reference count strategy with an infrequently executed copying strategy, which can reclaim unreachable cycles. ...
doi:10.1145/1541880.1541881
fatcat:nbrjxa6h6fberhpb2blzmqoio4
Investigating throughput degradation behavior of Java application servers
2006
Proceedings of the 4th international symposium on Principles and practice of programming in Java - PPPJ '06
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 2010; you can also visit the original URL.
The file type is application/pdf.
BACKGROUND AND RELATED WORK
Garbage Collection Overview One of the most useful language features of modern object-oriented programming languages is garbage collection (GC). ...
It then periodically updates reference counts for root referents and generates reference count increments and decrements using the logged objects. ...
doi:10.1145/1168054.1168061
dblp:conf/pppj/XianSJ06
fatcat:zyghnrdzvngtnd3vfvv45zdjce
Garbage collection: Java application servers' Achilles heel
2008
Science of Computer Programming
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.
As a preliminary study, we conducted an experiment to observe the throughput degradation behavior of a widely-used Java application server running a standardized benchmark and found that throughput performance ...
While strong emphasis has been placed on how to obtain peak performance, only a few research efforts have focused on these servers' ability to sustain top performance in spite of the ever-changing demands ...
Acknowledgments This work was sponsored in part by the National Science Foundation through awards CNS-0411043 and CNS-0720757 and by the Army Research Office through DURIP award W911NF-04-1-0104. ...
doi:10.1016/j.scico.2007.07.008
fatcat:zttrcpvpinfenfenduc23iagm4
Active memory processor: a hardware garbage collector for real-time java embedded devices
2003
IEEE Transactions on Mobile 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 2020; you can also visit the original URL.
The file type is application/pdf.
allocation, reference counting, and garbage collection. ...
Our study has shown that 3-bit reference counting can eliminate the need to invoke the garbage collector in all tested applications. Moreover, it also reduces the amount of memory usage by 77 percent. ...
As a reminder, full collection is used to collect unreachable sticky objects and cyclic structures in the proposed scheme. ...
doi:10.1109/tmc.2003.1217230
fatcat:hzrcfcwwabemtoq75pb3mt6toe
Concurrent compacting garbage collection of a persistent heap
1993
Proceedings of the fourteenth ACM symposium on Operating systems principles - SOSP '93
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 2007; you can also visit the original URL.
The file type is application/pdf.
The results suggest that replicating garbage collection offers a flexible and efficient way to provide automatic storage management in transaction systems, object-oriented databases and persistent programming ...
A log captures client write operations and is used to support both the transaction manager and the replicating garbage collector. ...
Acknowledgments We would like to thank DEC SRC, where replicating garbage collection was conceived during a very pleasant summer. ...
doi:10.1145/168619.168632
dblp:conf/sosp/OTooleNG93
fatcat:v5usd3unqvesde7eaexq76ojr4
Garbage Collection for Flexible Hard Real-Time Systems
2010
IEEE transactions on computers
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.
On the other hand, the mark-sweep component periodically identifies cyclic garbage, which cannot be found by the reference counting component. ...
A hybrid garbage collection algorithm, which combines both reference counting and mark-sweep, is designed according to the new design criteria. ...
is used in each object (in many cases) to store the reference count(s). ...
doi:10.1109/tc.2010.13
fatcat:mb2cj2up5vb6rbraplexl5rxy4
NV-Heaps
2011
Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems - ASPLOS '11
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 addition, the system must prevent new types of hard-to-find pointer safety bugs that only arise with persistent objects. ...
We have implemented a lightweight, high-performance persistent object system called NV-heaps that provides transactional semantics while preventing these errors and providing a model for persistence that ...
Object-oriented databases have taken a range of approaches from providing simple garbage collection [10] to allowing applications to specify complex structural invariants on data structures [3] . ...
doi:10.1145/1950365.1950380
dblp:conf/asplos/CoburnCAGGJS11
fatcat:6w5xtiax2bezbhawcew6lm46l4
NV-Heaps
2011
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 2017; you can also visit the original URL.
The file type is application/pdf.
In addition, the system must prevent new types of hard-to-find pointer safety bugs that only arise with persistent objects. ...
We have implemented a lightweight, high-performance persistent object system called NV-heaps that provides transactional semantics while preventing these errors and providing a model for persistence that ...
Object-oriented databases have taken a range of approaches from providing simple garbage collection [10] to allowing applications to specify complex structural invariants on data structures [3] . ...
doi:10.1145/1961296.1950380
fatcat:knenlt3q3va2bl5wpdxlydufsm
« Previous
Showing results 1 — 15 out of 573 results