Schedulability Test for Soft Real-Time Systems under Multiprocessor Environment by using an Earliest Deadline First Scheduling Algorithm

TL;DR

This paper introduces a new EDF-based scheduling scheme for multiprocessor soft real-time systems that ensures bounded deadline tardiness without strict total utilization constraints, improving scheduling efficiency.

Contribution

The paper proposes a novel EDF-based scheduling scheme with bounded tardiness, allowing flexible utilization and reducing overheads in multiprocessor soft real-time systems.

Findings

The new scheme guarantees bounded deadline tardiness.

It enables scheduling without strict total utilization limits.

Techniques to reduce tardiness and improve efficiency are proposed.

Abstract

This paper deals with the study of Earliest Deadline First (EDF) which is an optimal scheduling algorithm for uniprocessor real time systems use for scheduling the periodic task in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists EDF-based schemes and RMA scheduling (which is the only known way of optimally scheduling recurrent real-time tasks on multiprocessors): on M processors, all known EDF variants have utilization-based schedulability bounds of approximately M/2, while RMA algorithms can fully utilize all processors. This is unfortunate because EDF based algorithms entail lower scheduling and task migration overheads. In work on hard real-time systems, it has been shown that this disparity in Schedulability can be lessened by placing caps on per task utilizations. Our main contribution is a new EDF based scheme that ensures bounded deadline tardiness. In this scheme, per-task utilizations must be focused,but overall utilization need not be stricted. Our scheme should enable a wide range of soft real-time applications to be scheduled with no constraints on total utilization. Also propose techniques and heuristics that can be used to reduce tardiness as well as increase the efficiency of task.