Abstract
Rate monotonic (RM) and earliest deadline first (EDF) are representative scheduling algorithms for real-time periodic tasks. RM has a merit that tasks with high-priority (short-period) have small jitters and short response times. However, it is impossible that processor utilization reaches 100% while maintaining schedulability or that tasks are given importance independent of their periods. On the other hand, EDF can utilize processors by 100% while it cannot give tasks fixed priorities or importance. Therefore, it is difficult to keep jitters or response times of particular tasks short. The author proposed an EDF-based method, Adaptive EDF, of shortening response times of a task that is important for the system by introducing predictive execution times (PET) and dividing execution of the task into two sub instances based on PET [1]. This paper shows improved techniques which can further reduce response times by extending the adaptive EDF.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
