A Comparative Evaluation of Parallel Garbage Collector Implementations

Attanasio, C. R.; Bacon, David F.; Cocchi, Anthony; Smith, Stephen

doi:10.1007/3-540-35767-x_12

Cited by 22 publications

(37 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We refer to any point at which the bestperforming GC system changes as a switch point. These results support the findings of others [4,16,42], that no single collection system enables the best performance across benchmarks; moreover no single system performs best across heap sizes for a single benchmark/input pair.…”

Section: Application-specific Gcsupporting

confidence: 89%

“…However, many researchers have shown that there is no single combination of a collector and an allocator that enables the best performance for all applications, on all hardware, and given all resource constraints [4,16,42]. Figure 1 confirms these findings.…”

Section: Application-specific Gcmentioning

confidence: 54%

“…The goal of most of this prior work has been to provide general-purpose mechanisms that enable high-performance execution across all applications. However, other prior research [4,16,42,36] has shown that the efficacy of a memory management system (the allocator and the garbage collector) is dependent upon application behavior and available resources. That is, no single collection system enables the best performance for all applications and all heap sizes.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Dynamic selection of application-specific garbage collectors

Soman

Krintz

Bacon

2004

Proceedings of the 4th International Symposium on Memory Management

Self Cite

View full text Add to dashboard Cite

Much prior work has shown that the performance enabled by garbage collection (GC) systems is highly dependent upon the behavior of the application as well as on the available resources. That is, no single GC enables the best performance for all programs and all heap sizes. To address this limitation, we present the design, implementation, and empirical evaluation of a novel Java Virtual Machine (JVM) extension that facilitates dynamic switching between a number of very different and popular garbage collectors. We also show how to exploit this functionality using annotation-guided GC selection and evaluate the system using a large number of benchmarks. In addition, we implement and evaluate a simple heuristic to investigate the efficacy of switching automatically. Our results show that, on average, our annotation-guided system introduces less than 4% overhead and improves performance by 24% over the worstperforming GC (across heap sizes) and by 7% over always using the popular Generational/Mark-Sweep hybrid.

show abstract

Section: Application-specific Gcsupporting

confidence: 89%

Section: Application-specific Gcmentioning

confidence: 54%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic selection of application-specific garbage collectors

Soman

Krintz

Bacon

2004

Proceedings of the 4th International Symposium on Memory Management

Self Cite

View full text Add to dashboard Cite

show abstract

“…With the exception of 'chart' we provide re- 2 For example under the copy-in, process, copy-out-memory strategy. By NUMA we mean here platforms in which cores primarily access memory directly via DMA while communicating via message passing or small caches.…”

Section: Discussionmentioning

confidence: 99%

“…Attanasio et al (2) propose a copying collector for Java server application running on large symmetric multiprocessor platforms that reportedly scales as well as that of Flood et al Load balancing is implemented by maintaining a global list of work buffers containing multiple pointers to objects, from which work is stolen.…”

Section: Related Workmentioning

confidence: 99%

A new approach to parallelising tracing algorithms

Oancea

Mycroft

Watt

2009

Proceedings of the 2009 International Symposium on Memory Management

View full text Add to dashboard Cite

Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, replacing a nodes with their unvisited children. Previous work on parallel tracing is processororiented in associating one worklist per processor: worklist insertion and removal requires no locking, and load balancing requires only occasional locking. However, since multiple queues may contain the same node, significant locking is necessary to avoid concurrent visits by competing processors.This paper presents a memory-oriented solution: memory is partitioned into segments and each segment has its own worklist containing only nodes in that segment. At a given time at most one processor owns a given worklist. By arranging separate single-readersingle-writer forwarding queues to pass nodes from processor i to processor j we can process objects in an order that gives lock-free mainline code and improved locality of reference. This refactoring is analogous to the way in which a compiler changes an iteration space to eliminate data dependencies.While it is clear that our solution can be more effective on NUMA systems, and even necessary when processor-local memory may not be addressed from other processors, slightly surprisingly, it often gives significantly better speed-up on modern multi-cores architectures too. Using caches to hide memory latency loses much of its effectiveness when there is significant cross-processor memory contention or when locking is necessary.

show abstract

Handling Non-Periodic Events in Real-Time Java Systems

Masson¹,

Midonnet²

2011

Distributed, Embedded and Real-Time Java Systems

View full text Add to dashboard Cite

A Comparative Evaluation of Parallel Garbage Collector Implementations

Cited by 22 publications

References 8 publications

Dynamic selection of application-specific garbage collectors

Dynamic selection of application-specific garbage collectors

A new approach to parallelising tracing algorithms

Handling Non-Periodic Events in Real-Time Java Systems

Contact Info

Product

Resources

About