DocumentCode :
3092296
Title :
Imprecise computation fault-tolerant rate-monotonic scheduling
Author :
Chen, Yu ; Xiong, Guangze
Author_Institution :
Real-Time Lab., Univ. of Electron. Sci. & Technol., Chengdu, China
fYear :
2002
fDate :
23-25 Oct. 2002
Firstpage :
293
Lastpage :
296
Abstract :
Fault-tolerant real-time scheduling is a hot topic in dependable real-time system research. We combine the FT-RM with imprecise computation to increase the upper bound of resource utilization in the absence of faults. We prove that every task can meet its deadline in a specified interval, no matter whether there is a fault.
Keywords :
fault tolerant computing; processor scheduling; dependable real-time system; fault-tolerant real-time scheduling; imprecise computation fault-tolerant rate monotonic scheduling; resource utilization upper bound; task deadline meeting; Computer science; Educational institutions; Fault tolerance; Fault tolerant systems; Processor scheduling; Real time systems; Redundancy; Reliability; Resource management; Upper bound;
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.1173589
Filename :
1173589
Link To Document :
بازگشت