Abstract
The rate-monotonic (RM) algorithm is a classic fixed priority real-time scheduling algorithm. However, in most embedded real-time systems where the workload is composed of many tasks of high frequency and short execution time, the overheads from preemptions of the real-time operating system will lead to a low resource utilization rate if the RM algorithm is directly used. By studying the preemption relationship of the tasks scheduled by RM algorithm, a model of preemption overheads is established with task attributes, based on which the run-time preemption overheads of RM algorithm are reduced by optimizing the start time of the tasks in embedded real-time systems. Finally, the experimental results show the validity of the proposed strategy.
Sign-in/Register to access full text options 
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 callMore From: Frontiers of Electrical and Electronic Engineering in China
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.
