Resource reclaiming in multiprocessor real-time systems

C. Shen, K. Ramamritham, J.A. Stankovic
1993 IEEE Transactions on Parallel and Distributed Systems  
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,
more » ... d any run time anomalies, and have bounded overhead cost that is independent of the number of tasks in the schedule. 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 on-line local optimization. The effectiveness of the algorithms is demonstrated through simulation studies. The algorithms have also been implemented in the Spring Kernel [15].
doi:10.1109/71.219754 fatcat:rovvyem425e2dm36p4gvbcjsqm