Real-time systems (RTS) scheduling is an important component in real-time systems education and research. Dozens of well-known scheduling algorithms are introduced in many textbooks. It is desireable that, given a set of real-time task specifications, a dedicated software tool carries out the schedulability analysis and schedule generation. This thesis presents the design and development of such a tool.

The tool implements some most popular RTS scheduling algrorithms, such as the earliest-deadline-first (EDF) algorithm for one-time job scheduling, the EDF for periodic task scheduling, and the deadline-monotonic algorithm for periodic task scheduling. The tool evaluates RTS schedulability and plots the schedule for schedulable RTS. The tool has a friendly user interface which allows users to easily (1) add or delete tasks/jobs, (2) specify or modify the real-time parameters of tasks/jobs, (3) select tasks/jobs for scheduling, and (4) select select scheduling alogrithms. For periodic tasks, the tool automatically calculates the hyper-period and plots the schedule for one hyper-period. The tool also displays the jobs in the waiting queue over the entire scheduling process. The tool is helpful for both instructors and students of real-time systems classes: Firstly, it allows instructors to illustrate as many scheduling examples as possible during the limited class hours by simply changing the RTS tasks/jobs set or their real-time parameters. Second, it helps students to understand how the scheduling process proceeds with a given scheduling algorithm. Third, but not the last, it allows students to compare the scheduling results of a given RTS with different scheduling algorithms. The tool was written in Java.