Abstract
The scheduling algorithm is one of the most important portions of embedded operating systems especially for real-time embedded operating systems. The performance of scheduling algorithm influences the performance of the whole system. Real-time embedded operating system needs better response time for real-time process; it is more rigid on response time for hard real-time embedded operating system. A high-performance scheduling algorithm is required in order to make embedded operating system more efficient. Most of the mainstream scheduling algorithms are able to ensure response time for most processes, but for specific real-time applications for embedded system, a specialized real-time scheduling algorithm is required to ensure real-time response. In this paper, we propose a novel real-time scheduling algorithm for real-time embedded system. This algorithm divides all tasks into different sets and schedules the tasks according to the features of the set.
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 callDisclaimer: 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.
