A Schedulability Analysis Algorithm for EDF-Based End-to-End Real-Time Systems

An end-to-end real-time scheduling model can be used to describe many distributed real-time systems. In this paper, an EDF-based end-to-end real-time scheduling model is proposed. According to the time demand analysis technique, a schedulability condition for the end-to-end real-time system is deduced. Then, a schedulability analysis algorithm is developed. The schedulability condition and schedulablity analysis algorithm are suitable not only for end-to-end real-time systems controlled by non-greedy synchronization protocols, but also for those controlled by greedy synchronization protocol. Compared with fix-priority-based end-to-end real-time scheduling model and its algorithms, the model and algorithm proposed in this paper are simpler and easier to implement. Simulation results reveal that higher performance can be achieved too.