Abstract
In an open real-time system, the coexistence of different kinds of real-time and non real-time applications makes the system scheduling mechanism face new requirements and challenges. One two-level scheduling scheme of the open real-time systems was introduced. Through analysis, we find that the scheduling strategy for non real-time applications in original two-level scheduling scheme is too simple: it may make real-time applications unschedulable if non real-time applications contain non-preemptive sections (NPS). In order to avoid that, this paper proposes four pointed scheduling rules. Then by integrating the improved scheduling algorithm for non-real-time applications, we can solve problems existing in non real-time applications scheduling. Ultimately, the schedulability of real-time applications and non-real time applications can be guaranteed.
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: International Journal of Computer Theory and Engineering
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.
