Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems
Authors:
- E.D. JensenEJE.D. Jensen
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15332306,p. 101-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 resultsKeywords
This publication has 9 references indexed in Scilit:
- Improved Schedulability Analysis of EDF on Multiprocessor Platforms2006
- On Multiprocessor Utility Accrual Real-Time Scheduling with Statistical Timing Assurances2006
- Software organization to facilitate dynamic processor scheduling2004
- A real-time garbage collector with low overhead and consistent utilization2003
- Time-triggered garbage collection2003
- A parallel, real-time garbage collector2001
- Scheduling garbage collector for embedded real-time systems1999
- On bounding time and space for multiprocessor garbage collection1999
- List processing in real time on a serial computerCommunications of the ACM, 1978