Mark-sharing: A parallel garbage collection algorithm for low synchronization overhead

Hyunkyu Park, Changmin Lee, Seung Hun Kim, Won Woo Ro, Jean Luc Gaudiot

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Two main problems prevent a parallel garbage collection (GC) scheme with lock-based synchronization from providing a high level of scalability: the load imbalance and the runtime overhead of thread synchronization operations. These problems become even more serious as the number of available threads increases. We propose the Mark-Sharing algorithm to improve the performance of parallel GC using transactional memory (TM) systems. The Mark-Sharing algorithm guarantees that all threads access the shared resource by using both the task-stealing and task-releasing mechanisms appropriately. In addition, we introduce a selection manager that minimizes the contention and idle time of garbage collectors by maintaining task information. The proposed algorithm outperforms the prior pool-sharing algorithm of GC in the HTM, providing more than 90% performance improvement on average.

Original languageEnglish
Title of host publicationProceedings - 2013 19th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2013
PublisherIEEE Computer Society
Pages18-25
Number of pages8
ISBN (Print)9781479920815
DOIs
Publication statusPublished - 2013
Event2013 19th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2013 - Seoul, Korea, Republic of
Duration: 2013 Dec 152013 Dec 18

Publication series

NameProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
ISSN (Print)1521-9097

Other

Other2013 19th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2013
CountryKorea, Republic of
CitySeoul
Period13/12/1513/12/18

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Mark-sharing: A parallel garbage collection algorithm for low synchronization overhead'. Together they form a unique fingerprint.

Cite this