Fixed-Priority Scheduling of Periodic Tasks With End-to-End Deadlines

As an application of the framework, the thesis proposes an end-to-end scheduling based approach to the resource contention problem in distributed real-time systems. Simulation results show that the end-to-end scheduling approach performs better in many cases than an existing approach, known as the Multiprocessor Priority Ceiling Protocol. In the appendix, the thesis includes an in-depth discussion of sporadic server algorithms.

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

• Sun, Jun

Contributors dc:contributor

• Jane Liu

• Computer Science

Language dc:language

eng

Identifier

(MiAaPQ)AAI9737266

OAI identifier oai:identifier

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