Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems

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