Issue No. 04 - April (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.219754
<p>Most real-time scheduling algorithms schedule tasks with regard to their worst casecomputation times. Resources reclaiming refers to the problem of utilizing the resourcesleft unused by a task when it executes in less than its worst case computation time, orwhen 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 resourcerequirements. The algorithms utilize the information given in a multiprocessor taskschedule and perform online local optimization. The effectiveness of the algorithms isdemonstrated through simulation studies.</p>
Index Termsmultiprocessor real-time systems; real-time scheduling; worst case computation times;resource reclaiming; deadline; resource requirements; local optimization; computationalcomplexity; multiprocessing systems; real-time systems; resource allocation; scheduling
"Resource Reclaiming in Multiprocessor Real-Time Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 382-397, 1993.