An Optimal Order Assignment Algorithm for Single-Rate Time-Driven AFAP Cyclic Executives

In a recent survey, it was observed that the majority of the respondents to the question which task scheduling policy/policies are used in considered systems answered “static cy-cle/table driven/time-triggered”. Cyclic executives, though hardly addressed in contemporary text books, if at all, are therefore still in use in practice. Hence, there is a need for analysis techniques for these executives. In earlier work, exact analysis for single-rate AFAP (as fast as possible) and single-rate time-driven AFAP cyclic executives, scheduling a given sequence of independent hard real-time polling tasks in single-processor systems, has been presented. Unlike the analysis for single-rate AFAP cyclic executives, the analysis for single-rate time-driven AFAP cyclic executives depends on the order of the tasks in the cycle. In this paper, we present a conjecture for an optimal order assignment (OOA) algorithm for single-rate time-driven AFAP cyclic executives.