The Case for FIFO Real-Time Scheduling
Sebastian Altmeyer, Sakthivel Manikandan Sundharam, Nicolas Navet · OPUS (Augsburg University) · 2016
Selecting the right scheduling policy is a crucial issue in the development of an embedded real-time application.Whereas scheduling policies are typically judged according to their ability to schedule task sets at a high processor utilizations, other concerns, such as predictability and simplicity are often overlooked.In this paper, we argue that FIFO scheduling with offsets is a suitable choice when these concerns play a key role.To this end, we examine the predictability of FIFO, present a schedulability analysis for it and evaluate both, performance and predictability of FIFO scheduling with and without offsets.Our results show that FIFO with offsets exhibits competitive performance for task with regular periods, at an unmatched predictability.