Downloads & Free Reading Options - Results

Thesis advisor(s): Mantak Shing, Valdis Berzins

When a real time system has a mixed set of time critical tasks, including tasks with hard headlines and tasks with soft deadlines, managing a mixed set of tasks in a timely manner becomes harder and requires a multi-level architecture. This thesis concentrates on building such an architecture. The proposed architecture is based on the current Computer Aided Prototype System (CAPS) architecture, which only deals with hard real time and non-time-critical tasks. Priority based scheduling techniques are used along with Ada tasking to schedule different levels of tasks. Periodic hard real time polling tasks are used to insert sporadic soft real time tasks into the system. A method is developed to assign deadlines to soft real time tasks dynamically. Two tasking packages are added to the system for scheduling and execution of soft real time tasks. The Earliest Deadline First (EDF) algorithm is used dynamically to schedule soft real time tasks. A pilot prototype is developed to test the proposed architecture via a run time monitoring package. The results show that the proposed system guarantees that all hard real time tasks meet their deadlines and an acceptably small percentage of soft real time tasks miss their deadlines.

When a real time system has a mixed set of time critical tasks, including tasks with hard deadlines and tasks with soft deadlines, managing a mixed set of tasks in a timely manner becomes harder and requires a multi-level architecture. This thesis concentrates on building such an architecture. The proposed architecture is based on the current Computer Aided Prototype System (CAPS) architecture, which only deals with hard real time and non-time-critical tasks. Priority based scheduling techniques are used along with Ada tasking to schedule different levels of tasks. Periodic hard real time polling tasks are used to insert sporadic soft real time tasks into the system. A method is developed to assign deadlines to soft real time tasks dynamically. Two tasking packages are added to the system for scheduling and execution of soft real time tasks. The Earliest Deadline First (EDF) algorithm is used dynamically to schedule soft real time tasks. A pilot prototype is developed to test the proposed architecture via a run time monitoring package. The results show that the proposed system guarantees that all hard real time tasks meet their deadlines and an acceptably small percentage of soft real time tasks miss their deadlines.