Scheduling concurrent garbage collector using adaptive scheduling technique for multi-core systems Online publication date: Fri, 06-Oct-2017
by K.V. Charan; A.S. Manjunath
International Journal of Systems, Control and Communications (IJSCC), Vol. 8, No. 4, 2017
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Systems, Control and Communications (IJSCC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook