Contaminated garbage collection

Cannarozzi, Dante J.; Plezbert, Michael P.; Cytron, Ron K.

doi:10.1145/349299.349334

Cited by 31 publications

(12 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another unique garbage collection algorithm called Contaminated Garbage Collection, is proposed by Cannarozzi et al to solve the problem by answering another question [25]:…”

Section: Contaminated Garbage Collectionmentioning

confidence: 99%

“…Otherwise, the object is going to die at the same time as the last of such roots. In other words, among all the stack frames containing direct or indirect references to a specific object, the oldest one determines the liveness of that object and therefore, Cannarozzi et al define it as the dependent frame of that object [25].…”

Section: Contaminated Garbage Collectionmentioning

confidence: 99%

“…• A newly allocated heap object is considered as an equilive set with a single element whose dependent frame is the current stack frame [25].…”

Section: Contaminated Garbage Collectionmentioning

confidence: 99%

“…Contaminated collectors can also reclaim garbage without traversing the whole heap [25]. In many cases, objects can be identified and reclaimed within a fairly short time (much shorter than that of the standard tracing).…”

Section: Existing Non-real-time Garbage Collectorsmentioning

confidence: 99%

See 3 more Smart Citations

Garbage Collection for Flexible Hard Real-Time Systems

Chang

Wellings

2010

IEEE Trans. Comput.

View full text Add to dashboard Cite

Garbage collection is key to improving the productivity and code quality in virtually every computing system with dynamic memory requirements. It dramatically reduces the software complexity and consequently allows the programmers to concentrate on the real problems rather than struggling with memory management issues, which finally results in higher productivity. The code quality is also improved because the two most common memory related errors -dangling pointers and memory leaks -can be prevented (assuming that the garbage collectors are implemented correctly and the user programs are not malicious).However, real-time systems, particularly those with hard real-time requirements, always choose not to use garbage collection (or even dynamic memory) in order to avoid the unpredictable executions of garbage collectors as well as the chances of being blocked due to the lack of free memory. Much effort has been expended trying to build predictable garbage collectors which can provide both temporal and spatial guarantees. Unfortunately, most existing work leads to systems that cannot easily achieve a balance between temporal and spatial performance, although their worst-case behaviours in both dimensions can be predicted. Moreover, the real-time systems targeted by the existing real-time garbage collectors are not the state-ofthe-art ones. The scheduling of those garbage collectors has not been integrated into the modern real-time scheduling frameworks, which makes the benefits provided by those systems very difficult to obtain. This thesis argues that the aforementioned issues should be tackled by introducing new design criteria for real-time garbage collectors. The existing criteria are not enough to reflect the unique requirements of real-time systems. A new performance indicator is proposed to describe the capability of a real-time garbage collector to achieve better balance between temporal and spatial performance. Moreover, it is argued that new real-time garbage collectors should be integrated with the real-time task model and more advanced scheduling techniques should be adopted as well.A hybrid garbage collection algorithm, which combines both reference counting and mark-sweep, is designed according to the new design criteria. On the one hand, the reference counting component helps reduce the overall memory requirements. On the other hand, the mark-sweep component periodically identifies cyclic garbage, which cannot be found by the reference counting component. Both parts of the collector are executed by segregated tasks, which are released periodically as the hard real-time user tasks. In order to improve the performance of soft-or non-realtime tasks in our system while still guaranteeing the hard real-time requirements, the dual-priority scheduling algorithm is used for all the tasks including the GC tasks. A multi-heap approach is also proposed to bound the impacts of the softor non-real-time tasks on the overall memory usage as well as the executions of the GC tasks. More importantly, static ana...

show abstract

“…Another unique garbage collection algorithm called Contaminated Garbage Collection, is proposed by Cannarozzi et al to solve the problem by answering another question [25]:…”

Section: Contaminated Garbage Collectionmentioning

confidence: 99%

Section: Contaminated Garbage Collectionmentioning

confidence: 99%

“…• A newly allocated heap object is considered as an equilive set with a single element whose dependent frame is the current stack frame [25].…”

Section: Contaminated Garbage Collectionmentioning

confidence: 99%

Section: Existing Non-real-time Garbage Collectorsmentioning

confidence: 99%

See 2 more Smart Citations

Garbage Collection for Flexible Hard Real-Time Systems

Chang

Wellings

2010

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

“…A Mature Object Space (MOS) collector handles older generations specially, bounding the volume copied at any collection and offering (eventual) completeness [24]. Some regions may not be managed by a collector at all, either remaining uncollected [8], handled by static analysis [33], or via a stack-like discipline [11,18,30]. We could combine Beltway with other collectors, but such exploration is beyond the scope of this paper.…”

Section: Related Workmentioning

confidence: 99%

Beltway

Blackburn

Jones

McKinley

et al. 2002

Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

We present the design and implementation of a new garbage collection framework that significantly generalizes existing copying collectors. The Beltway framework exploits and separates object age and incrementality. It groups objects in one or more increments on queues called belts, collects belts independently, and collects increments on a belt in first-in-first-out order. We show that Beltway configurations, selected by command line options, act and perform the same as semi-space, generational, and older-first collectors, and encompass all previous copying collectors of which we are aware.The increasing reliance on garbage collected languages such as Java requires that the collector perform well. We show that the generality of Beltway enables us to design and implement new collectors that are robust to variations in heap size and improve total execution time over the best generational copying collectors of which we are aware by up to 40%, and on average by 5 to 10%, for small to moderate heap sizes. New garbage collection algorithms are rare, and yet we define not just one, but a new family of collectors that subsumes previous work. This generality enables us to explore a larger design space and build better collectors.

show abstract

Improving the memory management performance of RTSJ

Higuera-Toledano¹,

Issarny²

2005

Concurrency and Computation

View full text Add to dashboard Cite

To cite this version:M. Teresa Higuera-Toledano, Valérie Issarny. Improving the memory management performance of RTSJ. SUMMARYFrom a real-time perspective, the garbage collector (GC) introduces unpredictable pauses that are not tolerated by real-time tasks. Real-time collectors eliminate this problem but introduce a high overhead. Another approach is to use memory regions (MRs) within which allocation and deallocation is customized. This facility is supported by the memory model of the Real-Time Specification for Java (RTSJ). RTSJ imposes strict access and assignment rules to avoid both the dangling inter-region references and the delays of critical tasks of the GC. A dynamic check solution can incur high overhead, which can be reduced by taking advantage of hardware features. This paper provides an in-depth analytical investigation of the overhead introduced by dynamic assignments checks in RTSJ, describing and analysing several solutions to reduce the introduced overhead.

show abstract

Contaminated garbage collection

Cited by 31 publications

References 9 publications

Garbage Collection for Flexible Hard Real-Time Systems

Garbage Collection for Flexible Hard Real-Time Systems

Beltway

Improving the memory management performance of RTSJ

Contact Info

Product

Resources

About