A generic simulator of real-time scheduling algorithms
Stephane De Vroey, Joël Goossens, Christian Hernalsteen · 2002
We describe a language for defining scheduling algorithms for hard real-time systems and a tool to simulate the behavior of such systems on a predefined task set. The language is suitable for describing a real-time system composed of a task set, resources and a scheduling algorithm. The tasks can either be periodic or aperiodic, dependent or independent and the time constraints (e.g. deadlines) may be soft or hard. We consider two types of resources: the CPU and semaphores. Semaphores are used to describe the various possible dependences of the task set: shared memory, inter-task communication, devices etc. We consider only monoprocessor real-time systems. The third part of the system is given by the scheduling algorithm which is used to give resources (CPU and semaphores) to tasks.