CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

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

Risat Mahmud Pathan (Institutionen för data- och informationsteknik (Chalmers)) ; Jan Jonsson (Institutionen för data- och informationsteknik, Datorteknik (Chalmers))
Proceedings of the 16th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), Macau SAR, P.R.C., August 23-25, 2010 p. 265-274.
[Konferensbidrag, refereegranskat]

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.



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2010-06-08. Senast ändrad 2011-04-14.
CPL Pubid: 122468