Abstract
In this work we propose a two-phase scheduling technique (TOPS) for distributed real-time systems. Our TOPS scheduling approach has two distinct phases. The first phase is in charge of producing a scheduling sequence, whereas the second phase aims to dispatch tasks to computing nodes of a distributed system. The second phase also judiciously determines the starting time of each task. One salient feature of our approach lies in high flexibility, which allows system developers to apply multiple policies in each phase. The two phases are independent of one another; therefore, one can change a policy in one phase without configuring another phase. With TOPS in place, we are able to observe the impacts of sorting policies on the performance of scheduling policies. We implement a prototype of TOPS, where the first phase is comprised of three sorting policies, and the second phase consists of two scheduling policies. TOPS enables us to discover that combining the EDF (earliest deadline first) and AEAP (as early as possible) policies leads to an optimized performance among all six candidate algorithms.