A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
Abstruct-Most real-time scheduling algorithms schedule tasks with respect to their worst case computation times. Resource reclaiming refers to the problem of utilizing the resources left unused by a task when it executes less than its worst case computation time, or when a task is deleted from the current schedule. Resource reclaiming is a very important issue in dynamic realtime multiprocessor environments. In this paper, we present dynamic resource reclaiming algorithms that are egective,doi:10.1109/71.219754 fatcat:rovvyem425e2dm36p4gvbcjsqm