Value vs. deadline scheduling in overload conditions

giorgiosssupsssupit spurisssupsssupit In this paper we present a comparative study among scheduling algorithms which use dierent priority as signments and dierent guarantee mechanisms to im prove the performance of a realtime system during overload conditions In order to enhance the quality of service we assume that tasks are characterized not only by a deadline but also by an importance value The performance of the scheduling algorithm is then evaluated by computing the cumulative value gained on a task set ie the sum of the values of those tasks that completed by their deadline The purpose of this simulation study was twofold Firstly we wanted to discover which priority assig