A near-optimal algorithm for scheduling soft-aperiodic requests in dynamic priority systems

In this paper we propose a reasonably simple and near-optimal soft-aperiodic task scheduling algorithm in dynamic priority systems. The proposed algorithm has extended the EDF-CTI (Earliest Deadline First-Critical Task Indicating) Algorithm in such a way of modifying the slack calculation method which in turn reduces the computational complexity of slack calculation and resolves the unit scheduling problems. The paper also demonstrates near optimality of the algorithm. Our simulation study shows that the proposed algorithm, in most cases, is slightly better than the EDF-CTI algorithm in terms of short response time of aperiodic requests in a high workload