Abstract
The Shortest Job First (SJF) algorithm gives the optimal average turnaround time for a set of processes, but it suffers from starvation for long processes. In this study, the authors developed an algorithm, referred to as Equitable SJF (EQSJF), to reduce the average turnaround time of the long processes without notably affecting the turnaround time of the short processes. Two parameters, the percentage of a process’s burst time to completion and the time spent by a process in the waiting queue, were used to provide the designer with more tradeoff alternatives in keeping the turnaround time of the long processes under control while maintaining the turnaround time of the short processes at low levels, as they are required for soft real-time tasks. Comparisons with previously proposed scheduling algorithms such as the Highest Response Ratio Next (HRRN), Railroad Strategy, Enhanced Shortest Job First (ESJF), and Alpha show that the proposed approach always offers better alternatives.
Recommended Citation
Rene, Mario J. and Kagaris, Dimitri. "Equitable Shortest Job First: A Preemptive Scheduling Algorithm for Soft Real-Time Systems." INTERNATIONAL JOURNAL OF ENGINEERING RESEARCH AND INNOVATION 6, No. 1 (Jan 2014): 15-22.