Exact Fault-Tolerant Feasibility Analysis of Fixed-Priority Real-Time Tasks

被引：5

作者：

Pathan, Risat Mahmud ^{[1
]}

Jonsson, Jan ^{[1
]}

机构：

[1] Chalmers Univ Technol, SE-41296 Gothenburg, Sweden

来源：

16TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS (RTCSA 2010) | 2010年

关键词：

Real-time systems; real-time scheduling; transient faults; fault-tolerance; exact feasibility analysis; SCHEDULING ALGORITHM; PERIODIC TASKS; SYSTEMS; HARD; COMPLEXITY; PROCESSOR;

D O I：

10.1109/RTCSA.2010.24

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, a necessary and sufficient (exact) feasibility test is proposed for fixed-priority scheduling of a periodic task set to tolerate multiple faults on uniprocessor. We consider a fault model such that multiple faults can occur in any task and at any time, even during recovery operations. The proposed test considers tolerating a maximum of f faults that can occur within any time interval equal to the largest relative deadline of the task set. The feasibility of the task set is checked based on the maximum workload requested by the higher-priority jobs within the released time and deadline of the job of each task that is released at the critical instant. The maximum workload is calculated using a novel technique to compose the execution time of the higher-priority jobs. To the best of our knowledge, no other work (assuming the same fault model as ours) has derived an exact feasibility test for periodic task sets having a lower time complexity than that of the test proposed in this paper.

引用

页码：265 / 274

页数：10

共 50 条

[1] Enhanced Fault-Tolerant Fixed-Priority Scheduling of Hard Real-Time Tasks on Multi-Core Platforms
Han, Qiushi
Wang, Tianyi
Quan, Gang
[J]. 2015 IEEE 21ST INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, 2015, : 21 - 30
[2] An optimal fixed-priority assignment algorithm for supporting fault-tolerant hard real-time systems
Lima, GMD
Burns, A
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2003, 52 (10) : 1332 - 1346
[3] Schedulability analysis of the fault-tolerant hard real-time tasks with limited priority levels
Li, Jun
Yang, Fumin
Tu, Gang
Cao, Wanhua
Lu, Yansheng
[J]. AUTONOMIC AND TRUSTED COMPUTING, PROCEEDINGS, 2007, 4610 : 529 - +
[4] FTGS: Fault-Tolerant Fixed-Priority Scheduling on Multiprocessors
Pathan, Risat Mahmud
Jonsson, Jan
[J]. TRUSTCOM 2011: 2011 INTERNATIONAL JOINT CONFERENCE OF IEEE TRUSTCOM-11/IEEE ICESS-11/FCST-11, 2011, : 1164 - 1175
[5] ON THE COMPLEXITY OF FIXED-PRIORITY SCHEDULING OF PERIODIC, REAL-TIME TASKS
LEUNG, JYT
WHITEHEAD, J
[J]. PERFORMANCE EVALUATION, 1982, 2 (04) : 237 - 250
[6] Fault tolerant scheduling for fixed-priority tasks with preemption threshold
Wang, L
Wu, ZH
Zhao, MD
Yang, GQ
[J]. 11TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2005, : 220 - 225
[7] A New Covert Channel in Fixed-Priority Real-Time Multiframe Tasks
Babar, Mohammad Fakhruddin
Hasan, Monowar
[J]. 2024 IEEE 27TH INTERNATIONAL SYMPOSIUM ON REAL-TIME DISTRIBUTED COMPUTING, ISORC 2024, 2024,
[8] Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks
Chen, Jian-Jia
[J]. PROCEEDINGS OF THE 28TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS ECRTS 2016, 2016, : 251 - 261
[9] Scheduling fixed-priority hard real-time tasks in the presence of faults
Lima, G
Burns, A
[J]. DEPENDABLE COMPUTING, PROCEEDINGS, 2005, 3747 : 154 - 173
[10] Sensitivity analysis for fixed-priority real-time systems
Enrico Bini
Marco Di Natale
Giorgio Buttazzo
[J]. Real-Time Systems, 2008, 39 : 5 - 30

← 1 2 3 4 5 →