Resource reclaiming in multiprocessor real-time systems
- 1 April 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 4 (4) , 382-397
- https://doi.org/10.1109/71.219754
Abstract
Most real-time scheduling algorithms schedule tasks with regard to their worst case computation times. Resources 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. Dynamic resource reclaiming algorithms that are effective, avoid any run time anomalies, and have bounded overhead costs that are independent of the number of tasks in the schedule are presented. Each task is assumed to have a worst case computation time, a deadline, and a set of resource requirements. The algorithms utilize the information given in a multiprocessor task schedule and perform online local optimization. The effectiveness of the algorithms is demonstrated through simulation studies.Keywords
This publication has 12 references indexed in Scilit:
- Fast algorithms for scheduling imprecise computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- 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
- The Spring kernel: a new paradigm for real-time operating systemsACM SIGOPS Operating Systems Review, 1989
- Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraintsJournal of Systems and Software, 1987
- Scheduling Tasks with Nonuniform Deadlines on Two ProcessorsJournal of the ACM, 1976
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Production and Stabilization of Real-Time Task SchedulesJournal of the ACM, 1967