β Scribed by A. Sowmya
No coin nor oath required. For personal study only.
Real-time job scheduling is a difficult problem. The job scheduling system re ceives jobs from the environment, each job with its own real-time deadline. Queueing and scheduling may still be necessary, in order to maximize the processor usage and also to impose job priorities. In order to comptue different scheduling algorithms, formal methods to specify the real-time job scheduling system are necessary, 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 arithmetic of Yodaiken and Ramamritham.
π SIMILAR VOLUMES
## Abstract This paper describes how graph models are applied to specification, simulation, allocation, and scheduling of realβtime computer vision applications. Furthermore, we present a new environment that allows the user to specify a Computer Vision program using graphic schemes and evaluates a