A new real-time disk scheduling algorithm and its application to distributed multimedia storage systems

Abstract

In this paper, a new real-time disk scheduling algorithm called BFI (best-fit-insertion) is proposed. Notably, different from the conventional realtime problem, the service time of a disk request depends on its schedule result. As the service time is not a constant value, it is time-consuming to verify the feasibility of a schedule. In this paper, we introduce a temporal parameter called maximum tardiness. With the help of maximum tardiness, we can verify the improvement of an insertion test within a constant time. We have evaluated and implemented our proposed algorithm on operating systems. Experiments show that the proposed algorithm can support more requests and can achieve higher disk throughput than that of the conventional approach.