Design and evaluation of priority table based real-time scheduling algorithms

This paper proposes a new scheduling scheme based on priority table design by integrating two or more characteristic parameters of a task. Two real-time scheduling algorithms from the scheme are presented: EDV (earliest deadline first with larger value) and VED (value first with earlier deadline). Compared to the classical EDF and HVF algorithms, simulations show that the proposed algorithms improve performance under all workload situations.