Abstract
In this paper we present a new scheduling approach for servicing soft aperiodic requests in a hard real-time environment, where a set of hard periodic tasks is scheduled using the Earliest Deadline First algorithm. The main characteristic of the proposed algorithm is that it achieves full processor utilization and optimal aperiodic responsiveness, still guaranteeing the execution of the periodic tasks. Another interesting feature of the algorithm is that it can easily be tuned to change its performance and complexity according to the application requirements. Schedulability issues, performance results, and implementation complexity of the algorithm are discussed and compared with other classical methods, such as Background, the Total Bandwidth Sewer (TBS), and the optimal EDL server. Extensive simulations show that a substantial improvement can be achieved with a little increase of complexity, ranging from the TBS performance up to the optimal behavior.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.