@MASTERSTHESIS\{IMM2001-0769,
    author       = "Y. Naftchi",
    title        = "Animation of scheduling algorithms",
    year         = "2001",
    school       = "Informatics and Mathematical Modelling, Technical University of Denmark, {DTU}",
    address      = "Richard Petersens Plads, Building 321, {DK-}2800 Kgs. Lyngby",
    type         = "",
    url          = "http://www2.compute.dtu.dk/pubdb/pubs/769-full.html",
    abstract     = "The aim of this project is to develop (analyse, design, implement, test) a tool, which can illustrate the often-complicated relationships, which appear in connection with real-time scheduling. The problem to be solved involves the following: 

-Accepting information about the durations, deadlines and other required information of the activities. 
-From the available scheduling algorithms, picking the most appropriate one.
-Analysing the underlying assumption associated with the algorithm.
-Performing schedulability analysis on the given set of activities.
-Generating the possible sequence of the given task set by the chosen scheduling principle.
-Illustrating the generated sequence.

The developed tool makes it possible to display achievable schedules for a system based on the associated information with the activities concerned using various scheduling principles.

The program's ability to simulate the behaviour of shared resource from a scheduling viewpoint makes it ideal as an instructive tool."
}