Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems

Author

Na, Chewoo ; Cho, Hyeonjoong ; Ravindran, Binoy ; Jensen, E. Douglas

Author_Institution

ECE Dept., Virginia Tech., Blacksburg, VA

fYear

0

fDate

0-0 0

Firstpage

101

Lastpage

105

Abstract

We present a garbage collector scheduling algorithm for dynamic multiprocessor real-time systems 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 prove that GCMUA probabilistically lower bounds each mutator´s accrued utility, lower bounds the total accrued utility, and upper bounds the assurances´ sensitivity to variations in execution-time and memory demand estimates. Our simulation results confirm our analytical results

Keywords

multiprocessing systems; processor scheduling; real-time systems; storage management; GCMUA; dynamic multiprocessor real-time system; garbage collector scheduling algorithm; memory demand estimation; stochastic execution-time; time constraint; utility function; Analytical models; Dynamic scheduling; Real time systems; Scheduling algorithm; Stochastic processes; Stochastic systems; Time factors; Timing; Upper bound; Yarn;

fLanguage

English

Publisher

ieee

Conference_Titel

Embedded and Real-Time Computing Systems and Applications, 2006. Proceedings. 12th IEEE International Conference on

Conference_Location

Sydney, Qld.

ISSN

1533-2306

Print_ISBN

0-7695-2676-4

Type

conf

DOI

10.1109/RTCSA.2006.34

Filename

1691302