Scheduling parallel real-time tasks that allow imprecise results

Imprecise computation and parallel processing are two techniques for avoiding timing faults and tolerating hardware faults in hard real-time systems. When a result of the desired quality cannot be produced in time, hard real-time systems can produce an intermediate result of acceptable quality by imprecise computation, reduce the response time of the result by parallel processing, or both, to avoid timing faults. To mask hardware faults, a real-time task is replicated into several copies which are executed on distinct processing elements. The imprecise computation technique provides hard real-time systems with flexible functionality by trading off the quality of the result produced by a task with the amount of the computational resources required to produce it and thus enables the systems to reduce their computational loads in case of hardware faults. These two techniques permit the performance of hard real-time systems to remain predictable and to degrade gracefully.

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

2011

Author dc:creator

• Yu, Albert Chuang-Shi

Contributors dc:contributor

• Lin, Kwei-Jay

• Computer Science

Statement dc:rights

• Copyright 1992 Yu, Albert Chuang-Shi

Language dc:language

eng

Identifier

AAI9236634
(UMI)AAI9236634

OAI identifier oai:identifier

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