A behavior priority driven approach for resource reservation scheduling

Abstract

In this paper a behavioral distinction of soft real-time tasks is introduced. The distinction is based on the behavior of the previous instance of each task and it is used to propose a scheduling algorithm. The algorithm, called BIDS, uses well-known server mechanisms with an extension to handle two priority queues within each server. The priority of a server is managed accordingly to the result that is associated task produce. Along with the formal presentation of the algorithm and the proofs of its properties some performance evaluations based on simulations are included.