Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Scheduling concurrent garbage collector using adaptive scheduling technique for multi-core systems

Scheduling concurrent garbage collector using adaptive scheduling technique for multi-core systems Concurrent garbage collectors (CGC) are contributing significantly to reinforce the performance of recently dominated multi-core systems by exploiting full potential of the processing resources. The software designers have turned into managed languages for developing time sensitive real-time applications due to security and execution parallelism. However, as the complexity of applications, heap size and number of cores in a system is scaled up, it raises many issues in the designing of CGC. In this paper, we examine two factors, reducing the number of garbage collection (GC) pauses and mitigating probability of stop-the-world (STW) pauses that can affect performance of CGC. We propose an adoptive garbage collection scheduling strategy which is based on the amount of remaining heap memory. The implementation results shows that adaptive garbage collection can have better real-time performance than periodic, slack-based and static allocation-trigger based garbage collections. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Systems, Control and Communications Inderscience Publishers

Scheduling concurrent garbage collector using adaptive scheduling technique for multi-core systems

Download PDF
12 pages

Loading next page...
 
/lp/inderscience-publishers/scheduling-concurrent-garbage-collector-using-adaptive-scheduling-q0gMP4LBJu

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd
ISSN
1755-9340
eISSN
1755-9359
DOI
10.1504/IJSCC.2017.087145
Publisher site
See Article on Publisher Site

Abstract

Concurrent garbage collectors (CGC) are contributing significantly to reinforce the performance of recently dominated multi-core systems by exploiting full potential of the processing resources. The software designers have turned into managed languages for developing time sensitive real-time applications due to security and execution parallelism. However, as the complexity of applications, heap size and number of cores in a system is scaled up, it raises many issues in the designing of CGC. In this paper, we examine two factors, reducing the number of garbage collection (GC) pauses and mitigating probability of stop-the-world (STW) pauses that can affect performance of CGC. We propose an adoptive garbage collection scheduling strategy which is based on the amount of remaining heap memory. The implementation results shows that adaptive garbage collection can have better real-time performance than periodic, slack-based and static allocation-trigger based garbage collections.

Journal

International Journal of Systems, Control and Communications – Inderscience Publishers

Published: Jan 1, 2017

There are no references for this article.