Abstract
A real-time job scheduling system receives jobs from the environment, which must be queued and scheduled such that job deadlines and priorities are satisfied and processor usage is optimized. In order to compare different scheduling algorithms, formal methods that help to model the system are highly useful. In a previous paper, we developed a statecharts-based specification of real-time job scheduling systems. This paper uses a recent version of timed statecharts for the same problem and compares them to the earlier approach. Some surprising conclusions are reached.
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.
