Zur Webseite der Informatik

Project SAVORS

Simulation and Visualization of Real-time Systems

SAVORS is an Eclipse RCP (Rich Client Platform), written in Java, which supports the synchronous simulation and visualization of single and multi-core scheduling algorithms. It is a discrete-time, event-driven, simulation framework developed using the Eclipse Modelling Framework (EMF) and the Graphical Editing Framework (GEF).

Some of the single-core algorithms supported by SAVORS are:

  • Static priority:

    • Fixed priority preemptive scheduling
    • DMS (deadline monotonic scheduling)
    • RMS (rate monotonic scheduling)
  • Dynamic priority:

    • EDF (earliest deadline first)

Some of the multi-core scheduling algorithms (for periodic and sporadic tasks) supported are:

  • Global:

    • the proportionate fair group of algorithms (Pfair, PD, PD2, PD2*, ER-Fair)
    • the boundary fair group of algorithms (Bfair and BF2)
    • the algorithms based on EDF: the unfair algorithm (U-EDF), global EDF, GSN-EDF and PSN-EDF
  • Partitioned:
    P-EDF (partitioned EDF)

In addition to these scheduling algorithms, the simulator supports the following resource allocation protocols to enable the synchronization of shared resources, thereby mitigating the risk of unpredictable performance:

  • Single core:

    • Simple and transitive priority inheritance
    • SRP (Stack Resource Protocol)
    • OCPP and ICPP: the ceiling priority protocols
    • Baker’s protocol
  • Multi-core:
    • FMLP (Flexible Multiprocessor Locking Protocol)

The output of SAVORS is the schedule produced from the simulation model, which is presented in an interactive GUI.

SAVORS is continuously enhanced and used both for teaching and research by ISTE/PS.