Abstract
Real-time job scheduling is a difficult problem. The job scheduling system receives jobs from the environment, each job with its own real-time deadline. Queuing and scheduling may still be necessary, in order to maximize the processor usage and also to impose job priorities. In order to compare different scheduling algorithms, we need formal methods to specify the real-time job scheduling system, so that properties of the algorithms may be tested against the specified model, prior to implementation. This paper develops a statecharts-based specification for real-time job scheduling systems, and compares it to the modal primitive recursive recursive arithmetic of Yodaiken and Ramamritham.
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.
