Name
Abstract | ||
|---|---|---|
Time redundancy is an effective method for achieving fault tolerance in a real-time system, when space redun- dancy cannot be used for cost or weight constraints. This paper presents a fault-tolerant scheduling algorithm for real-time systems consisting of firm and hard periodic tasks. Firm tasks can occasionally skip one instance according to a predefined quality-of- service parameter, whereas hard tasks include a primary and a backup job. The proposed scheduling algorithm ensures that each task instance is sat- isfied within its timing constraints by either the primary or the backup job. Moreover, the algorithm maximizes the pro- cessor idle time available for processing primary jobs and automatically reclaims the spare time saved by deallocat- ing backup jobs. A very interesting feature of the algorithm is that it can be tuned to balance performance versus com- plexity, so easily conforming to application's requirements. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/RTCSA.1998.726422 | RTCSA |
Keywords | Field | DocType |
fault tolerant computing,real-time systems,redundancy,resource allocation,scheduling,application requirements,backup job,fault tolerance,fault tolerant scheduling algorithm,firm real time systems,firm tasks,hard periodic tasks,job deallocation,optimal scheduling,predefined quality of service parameter,primary jobs,processor idle time,scheduling algorithm,space redundancy,task instance,time redundancy,timing constraints,weight constraints | Spare part,Computer science,Scheduling (computing),Quality of service,Real-time computing,Real-time operating system,Fault tolerance,Redundancy (engineering),Resource allocation,Backup,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-8186-9209-X | 24 | 1.34 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mario Cáccamo | 1 | 464 | 80.82 |
| giorgio buttazzo | 2 | 543 | 39.95 |