Probabilistic Analysis and Scheduling of Critical Soft Real -Time Systems

Allowing a real-time system to miss some deadlines in exchange for better average performance increases the possibility of overload. While overload in real-time systems has been studied, the emphasis has been on hard real-time systems in which overload is an exception whose occurrence is to be minimized. In contrast, critical soft real-time systems can be repeatedly overloaded during normal operation. Therefore, we have evaluated the performance of various real-time scheduling algorithms for critical soft real-time systems, including two new classes of algorithms, on workloads with execution and inter-release time variations, both with and without dependencies.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Gardner, Mark K.

Contributors dc:contributor

• Liu, Jane W.S.

• Engineering, System Science

Language dc:language

eng

Identifier

(MiAaPQ)AAI9953022

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/81955