A SIMULATION STUDY OF RESOURCE RECLAMATION IN REAL . TIME MULTIPROCESSOR SYSTEMS

Abstract

Dynamic scheduling of tasks in real-time multiprocessor systems is done based on the worst case- computation- -time of the tasks which is assumed to be known. But, tasks often complete before this upper bound- of computation time. The resources that have been allotted to such tasks can be given to the tasks waiting in the schedule, thus leading. to an improved system performance. This dissertation aims at studying the effect of using resource reclamation through simulation studies. A dynamic non-preemptive schedule-r- based- on heuristics is implemented for. -a multiprocessor system and two resource r--e_c-l-ai-ming , -algorithms namely, Basic reclaim-ing and Reclaiming with Early start are incorporated in it. The improvement in system performance is studied by means of the performance-metric guarantee ratio.