A hardware scheduler for complex real-time systems

The problem of jointly scheduling both hard deadline periodic tasks and soft aperiodic tasks has been the subject of considerable research in real-time systems. One of the most widely accepted solutions for this problem are slack stealing algorithms. However, these algorithms are rather impractical, since they all imply a considerable scheduler overhead. This paper faces the overhead problem by introducing a complete hardware architecture that implements slack stealing in hardware using an optimal algorithm that has been completely redesigned to perform efficiently in hardware. The proposed solution is a circuit that behaves as a kind of sophisticated interrupt controller that takes the task workload and the interrupts as inputs, and provides an output to inform the CPU which is the highest priority task. From the point of view of hardware design, the algorithm involves two main problems: first, to select the highest priority task at every moment and, second, to locate a set of slack gaps in a real-time computation. Locating slack gaps in a real-time computation is a problem that requires to “look forward in time” into the forecast schedule of a given workload. This paper presents a novel architecture that shows how to solve this problem in an efficient way using an event-driven simulation. A timing analysis of the proposed design is also presented