Resource reclaiming in real time
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Resource reclaiming refers to the problem of utilizing the resources left unused by a task when it executes in less than its worst-case computation time, or when a task is deleted from the current schedule. In dynamic real-time multiprocessor environments, resource reclaiming can be used to improve the average performance. Dynamic resource reclaiming algorithms must be effective in reclaiming unused time and also avoiding any anomalies. The authors present resource reclaiming algorithms with these properties. These algorithms are designed to have time complexity independent of the number of tasks in a schedule. The effectiveness of the algorithms is demonstrated through simulation studies. The algorithms have also been implemented in the Spring Kernel.Keywords
This publication has 13 references indexed in Scilit:
- On-line scheduling of real-time tasksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Efficient scheduling algorithms for real-time multiprocessor systemsIEEE Transactions on Parallel and Distributed Systems, 1990
- Resource reclaiming in real timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Mode change protocols for priority-driven preemptive schedulingReal-Time Systems, 1989
- Some Results of the Earliest Deadline Scheduling AlgorithmIEEE Transactions on Software Engineering, 1989
- The Spring kernel: a new paradigm for real-time operating systemsACM SIGOPS Operating Systems Review, 1989
- Distributed scheduling of tasks with deadlines and resource requirementsIEEE Transactions on Computers, 1989
- Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraintsJournal of Systems and Software, 1987
- Preemptive Scheduling Under Time and Resource ConstraintsIEEE Transactions on Computers, 1987
- Production and Stabilization of Real-Time Task SchedulesJournal of the ACM, 1967