Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems

Authors
Cho, HyeonjoongRavindran, BinoyNa, Chewoo
Issue Date
6월-2009
Publisher
IEEE COMPUTER SOC
Keywords
Real time; garbage collection; time/utility functions; scheduling; multiprocessors
Citation
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, v.20, no.6, pp.845 - 856
Indexed
SCIE
SCOPUS
Journal Title
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
Volume
20
Number
6
Start Page
845
End Page
856
URI
https://scholar.korea.ac.kr/handle/2021.sw.korea/119953
DOI
10.1109/TPDS.2009.20
ISSN
1045-9219
Abstract
We consider garbage collection (GC) in dynamic, multiprocessor real-time systems. We consider the time-based, concurrent GC approach and focus on real-time scheduling to obtain mutator timing assurances, despite memory allocation and garbage collection. We present a scheduling algorithm called GCMUA. The algorithm considers mutator activities that are subject to time/utility function time constraints, stochastic execution-time and memory demands, and overloads. We establish that GCMUA probabilistically lower bounds each mutator activity's accrued utility, lower bounds the system-wide total accrued utility, and upper bounds the timing assurances' sensitivity to variations in mutator execution-time and memory demand estimates. Our simulation experiments validate our analytical results and confirm GCMUA's effectiveness.
Files in This Item
There are no files associated with this item.
Appears in
Collections
Graduate School > Department of Computer and Information Science > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher CHO, HYEON JOONG photo

CHO, HYEON JOONG
컴퓨터정보학과
Read more

Altmetrics

Total Views & Downloads

BROWSE