Fault-tolerant scheduling under time and resource constraints

Author

Shu, LihChyun ; Young, Michal

Author_Institution

Dept. of Inf. Manage., Chang Jung Univ., Tainan, Taiwan

fYear

2001

fDate

2001

Firstpage

117

Lastpage

119

Abstract

S. Ghosh et al. (1998) presented a novel approach for providing fault tolerance for sets of independent, periodic tasks with rate-monotonic scheduling. We extend this approach to tasks that share logical or physical resources (and hence require synchronization). We show that if the simple rate-monotonic dispatch is replaced by stack scheduling (T. Baker, 1991), the worst-case blocking overhead of the stack resource policy and the worst-case retry overhead for fault tolerance are not additive, but rather only the maximum of the two overheads is incurred

Keywords

fault tolerant computing; resource allocation; scheduling; synchronisation; fault tolerance; fault tolerant scheduling; independent periodic tasks; physical resources; rate-monotonic dispatch; rate-monotonic scheduling; resource constraints; stack resource policy; stack scheduling; synchronization; time constraints; worst-case blocking overhead; worst-case retry overhead; Councils; Delay; Fault detection; Fault tolerance; Information management; Information science; Processor scheduling; Protection; Redundancy; Time factors;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Technology and Applications Symposium, 2001. Proceedings. Seventh IEEE

Conference_Location

Taipei

ISSN

1080-1812

Print_ISBN

0-7695-1134-1

Type

conf

DOI

10.1109/RTTAS.2001.929873

Filename

929873