Abstract
ABSTRACTThe mark-compact garbage collection algorithm shifts live objects so that they are next to each other to maximize space utilization efficiency and enable rapid object allocation. However, the algorithm requires multiple passes over a heap of objects, extending the time required for reclaiming unused memory. To shorten the collection time, we propose a skip compactor for garbage collection algorithm that avoids accessing dead objects by merging contiguous dead objects and reduces the number of object relocations. In this paper, we have implemented the proposed algorithm in the Jikes RVM, and measured the performance with the SPECjvm98 and DaCapo2006 benchmark suites. The proposed algorithm reduces the pause time of programs by 25% on average.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
