DocumentCode :
3092236
Title :
Fault-tolerant earliest deadline first scheduling with resource reclaim
Author :
Chen, Yu ; Yu, Xun ; Xiong, Guangze
Author_Institution :
Coll. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol., Chengdu, China
fYear :
2002
fDate :
23-25 Oct. 2002
Firstpage :
278
Lastpage :
285
Abstract :
A fault-tolerant real-time scheduling algorithm through time redundancy, with a schedulability bound, is based on the worst execution time of tasks and the time reserved for fault-tolerant operation of tasks, has a high rejection rate and low resource utilization. This paper presents fault-tolerant earliest deadline scheduling with resource reclaim, based on FT-EDF, to improve resource utilization and task throughput. This algorithm makes use of the fact that the actual execution time of the task is lower than the worst execution time, to reclaim and reuse the resource released by the completed task.
Keywords :
computational complexity; processor scheduling; real-time systems; software fault tolerance; fault-tolerant earliest deadline first scheduling; fault-tolerant real-time scheduling algorithm; rejection rate; resource reclaim; resource utilization; schedulability bound; task execution time; task throughput; time redundancy; worst execution time; Fault tolerance; Fault tolerant systems; Hardware; Processor scheduling; Real time systems; Redundancy; Reliability; Resource management; Scheduling algorithm; Throughput;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Algorithms and Architectures for Parallel Processing, 2002. Proceedings. Fifth International Conference on
Conference_Location :
Beijing, China
Print_ISBN :
0-7695-1512-6
Type :
conf
DOI :
10.1109/ICAPP.2002.1173587
Filename :
1173587
Link To Document :
بازگشت