NDLI: Real-time scheduling under fault bursts with multiple recovery strategy

Content Provider	IEEE Xplore Digital Library
Author	Haque, M.A. Aydin, H. Dakai Zhu
Copyright Year	2014
Description	Author affiliation: Dept. of Comput. Sci., Univ. of Texas at San Antonio, San Antonio, TX, USA (Dakai Zhu) \|\| Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA (Haque, M.A.; Aydin, H.)
Abstract	In this paper, we consider the feasibility problem of a set of real-time jobs which may be subject to a fault burst during execution. A fault burst represents a time interval during which multiple jobs may incur faults; hence multiple recoveries may be needed. We show that determining the feasibility of a real-time system, which may be subject to a fault burst that may last at most Δ time units, is an NP-Hard problem even when the exact position of the fault burst is known a priori. However, in a practical system, the fault burst may occur at any arbitrary and unpredictable time. We develop feasibility analysis by assuming multiple recovery strategy where, in addition to the job at the end of which the fault is detected, all preempted tasks are also re-executed. We formally characterize the overhead that a scheduler incurs due to a fault burst and present a generic recovery strategy, called Δ-idling, that is shown to minimize the worst-case overhead for any priority-driven scheduling algorithm. Next, we analyze periodic task systems. We show that the preemptive EDF policy, when coupled with Δ-idling, provides the highest possible utilization bound ½ (1 - Δ over $P_{min}),$ where $P_{min}$ is the smallest task period. We also present an empirical evaluation of the EDF policy with Δ-idling over synthetically generated task sets, and show that it offers a clear improvement over the naive EDF policy that triggers the recovery tasks as soon as an error is detected.
Starting Page	63
Ending Page	74
File Size	504469
Page Count	12
File Format	PDF
ISBN	9781479946914
ISSN	10801812
e-ISBN	9781479948291
DOI	10.1109/RTAS.2014.6925991
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-04-15
Publisher Place	Germany
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Schedules Scheduling algorithms Fault detection Real-time systems Circuit faults Transient analysis
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Real-time scheduling under fault bursts with multiple recovery strategy.

Recovery of fault-tolerant real-time scheduling algorithm for tolerating multiple transient faults

Fault-Tolerant Real-Time Scheduling Algorithm for Tolerating Multiple Transient Faults

Scheduling Analysis under Fault Bursts

Bounding the effectiveness of temporal redundancy in fault-tolerant real-time scheduling under error bursts

A real time scheduling algorithm for tolerating single transient fault

Scheduling and voltage scaling for energy/reliability trade-offs in fault-tolerant time-triggered embedded systems

Enhancing real-time schedules to tolerate transient faults

Design methodology for fault-tolerant heterogeneous MPSoC under real-time constraints

Real-time scheduling under fault bursts with multiple recovery strategy

Similar Documents

Real-time scheduling under fault bursts with multiple recovery strategy.

Recovery of fault-tolerant real-time scheduling algorithm for tolerating multiple transient faults

Fault-Tolerant Real-Time Scheduling Algorithm for Tolerating Multiple Transient Faults

Scheduling Analysis under Fault Bursts

Bounding the effectiveness of temporal redundancy in fault-tolerant real-time scheduling under error bursts

A real time scheduling algorithm for tolerating single transient fault

Scheduling and voltage scaling for energy/reliability trade-offs in fault-tolerant time-triggered embedded systems

Enhancing real-time schedules to tolerate transient faults

Design methodology for fault-tolerant heterogeneous MPSoC under real-time constraints

Real-time scheduling under fault bursts with multiple recovery strategy