• Summary
• Related Documents
  • Active Bibliography
  • Co-citation
• Version History

Popular Tags

No tags have been applied to this document.

Add a tag:

BibTeX | Add To MetaCart

@INPROCEEDINGS{Bacon01javawithout,
    author = {David F. Bacon and Clement R. Attanasio and Han B. Lee and V. T. Rajan and Stephen Smith},
    title = {Java without the coffee breaks: A nonintrusive multiprocessor garbage collector},
    booktitle = {In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (Snowbird},
    year = {2001},
    pages = {92--103},
    publisher = {ACM Press}
}

Years of Citing Articles

Abstract:

The deployment of Java as a concurrent programming language has created a critical need for high-performance, concurrent, and incremental multiprocessor garbage collection. We present the Recycler, a fully concurrent pure reference counting garbage collector that we have implemented in the Jalape~no Java virtual machine running on shared memory multiprocessors. While a variety of multiprocessor collectors have been proposed and some have been implemented, experimental data is limited and there is little quantitative basis for comparison between dierent algorithms. We present measurements of the Recycler and compare it against a non-concurrent but parallel load-balancing mark-and-sweep collector (that we also implemented in Jalape~no), and evaluate the classical tradeo between response time and throughput. When processor or memory resources are limited, the Recycler runs at about 90 % of the speed of the mark-and-sweep collector. However, with an extra processor to run collection and with a moderate amount of memory headroom, the Recycler is able to operate without ever blocking the mutators and achieves a maximum measured mutator delay of only 6 milliseconds for our benchmarks. End-to-end execution time is usually increased only slightly, but is sometimes substantially better or worse, presumably due to locality effects.

Citations