%0 Conference Paper %1 1064988 %A Click, Cliff %A Tene, Gil %A Wolf, Michael %B VEE '05: Proceedings of the 1st ACM/USENIX international conference on Virtual execution environments %C New York, NY, USA %D 2005 %I ACM %K Azul GC GarbageCollection Memory Pauseless Performance %P 46--56 %R 10.1145/1064979.1064988 %T The Pauseless GC Algorithm %U http://portal.acm.org/citation.cfm?id=1064988 %X Modern transactional response-time sensitive applications have run into practical limits on the size of garbage collected heaps. The heap can only grow until GC pauses exceed the response-time limits. Sustainable, scalable concurrent collection has become a feature worth paying for.Azul Systems has built a custom system (CPU, chip, board, and OS) specifically to run garbage collected virtual machines. The custom CPU includes a read barrier instruction. The read barrier enables a highly concurrent (no stop-the-world phases), parallel and compacting GC algorithm. The Pauseless algorithm is designed for uninterrupted application execution and consistent mutator throughput in every GC phase.Beyond the basic requirement of collecting faster than the allocation rate, the Pauseless collector is never in a "rush" to complete any GC phase. No phase places an undue burden on the mutators nor do phases race to complete before the mutators produce more work. Portions of the Pauseless algorithm also feature a "self-healing" behavior which limits mutator overhead and reduces mutator sensitivity to the current GC state.We present the Pauseless GC algorithm, the supporting hardware features that enable it, and data on the overhead, efficiency, and pause times when running a sustained workload. %@ 1-59593-047-7

@inproceedings{1064988, abstract = {Modern transactional response-time sensitive applications have run into practical limits on the size of garbage collected heaps. The heap can only grow until GC pauses exceed the response-time limits. Sustainable, scalable concurrent collection has become a feature worth paying for.Azul Systems has built a custom system (CPU, chip, board, and OS) specifically to run garbage collected virtual machines. The custom CPU includes a read barrier instruction. The read barrier enables a highly concurrent (no stop-the-world phases), parallel and compacting GC algorithm. The Pauseless algorithm is designed for uninterrupted application execution and consistent mutator throughput in every GC phase.Beyond the basic requirement of collecting faster than the allocation rate, the Pauseless collector is never in a "rush" to complete any GC phase. No phase places an undue burden on the mutators nor do phases race to complete before the mutators produce more work. Portions of the Pauseless algorithm also feature a "self-healing" behavior which limits mutator overhead and reduces mutator sensitivity to the current GC state.We present the Pauseless GC algorithm, the supporting hardware features that enable it, and data on the overhead, efficiency, and pause times when running a sustained workload.}, added-at = {2010-07-25T22:34:56.000+0200}, address = {New York, NY, USA}, author = {Click, Cliff and Tene, Gil and Wolf, Michael}, biburl = {https://www.bibsonomy.org/bibtex/2bf5ddb95faa500429f75ee8ea92ec61d/gron}, booktitle = {VEE '05: Proceedings of the 1st ACM/USENIX international conference on Virtual execution environments}, description = {The pauseless GC algorithm}, doi = {10.1145/1064979.1064988}, interhash = {a18f41bd12bddbae6601dc630f847537}, intrahash = {bf5ddb95faa500429f75ee8ea92ec61d}, isbn = {1-59593-047-7}, keywords = {Azul GC GarbageCollection Memory Pauseless Performance}, location = {Chicago, IL, USA}, pages = {46--56}, publisher = {ACM}, timestamp = {2010-07-25T22:34:56.000+0200}, title = {The Pauseless GC Algorithm}, url = {http://portal.acm.org/citation.cfm?id=1064988}, year = 2005 }