NDLI: Scheduling Hard-Real-Time Tasks with Backup Phasing Delay

Content Provider	IEEE Xplore Digital Library
Author	Bertossi, A.A. Mancini, L.V. Menapace, A.
Copyright Year	2006
Description	Author affiliation: Dipartimento di Sci. dell'Informazione, Bologna Univ. (Bertossi, A.A.)
Abstract	This paper presents several fault-tolerant extensions of the Rate-Monotonic First-Fit multiprocessor scheduling algorithm handling both active and passive task copies. In particular, the technique of backup phasing delay is used to reduce the portions of active task copies that must be always executed and to deallocate active task copies as soon as their primary task copies have been successfully executed. It is also shown how to employ this technique while considering passive task duplication so as to over-book each processor with many passive task copies, assigning tasks to processors in such a way that tasks with equal or multiple periods have a high chance to be assigned to the same processor, and partitioning the processors into groups to avoid the mix of primary, active, and passive task copies on the same processor. Extensive simulations reveal a remarkable saving of both the overall number of processors used and the total computation time of the schedulability test (achieved especially by two new algorithms, called ARR3 and S-PR-PASS) with respect to previously proposed algorithms
Sponsorship	IEEE CPS
Starting Page	107
Ending Page	118
File Size	223981
Page Count	12
File Format	PDF
ISBN	0769526977
ISSN	15506525
DOI	10.1109/DS-RT.2006.33
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-10-02
Publisher Place	Spain
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Processor scheduling Scheduling algorithm Delay effects Fault tolerant systems Multiprocessing systems Testing Fault tolerance Computational modeling Partitioning algorithms Monitoring
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

Fault-tolerant deadline-monotonic algorithm for scheduling hard-real-time tasks

An efficient fault-tolerant scheduling algorithm for periodic real-time tasks in heterogeneous platforms

A Novel Intelligent Algorithm for Fault-Tolerant Task Scheduling in Real-Time Multiprocessor Systems

Fault tolerant scheduling for fixed-priority tasks with preemption threshold

A Modified BCE Algorithm for Fault-Tolerance Scheduling of Periodic Tasks in Hard Real-Time Systems

Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems

An optimal point in scheduling real-time tasks process based on fault tolerant imprecise computation model

A new fault-tolerant scheduling technique for real-time multiprocessor systems

A scheduling algorithm for replicated real-time tasks

Scheduling Hard-Real-Time Tasks with Backup Phasing Delay

Similar Documents

Fault-tolerant deadline-monotonic algorithm for scheduling hard-real-time tasks

An efficient fault-tolerant scheduling algorithm for periodic real-time tasks in heterogeneous platforms

A Novel Intelligent Algorithm for Fault-Tolerant Task Scheduling in Real-Time Multiprocessor Systems

Fault tolerant scheduling for fixed-priority tasks with preemption threshold

A Modified BCE Algorithm for Fault-Tolerance Scheduling of Periodic Tasks in Hard Real-Time Systems

Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems

An optimal point in scheduling real-time tasks process based on fault tolerant imprecise computation model

A new fault-tolerant scheduling technique for real-time multiprocessor systems

A scheduling algorithm for replicated real-time tasks

Scheduling Hard-Real-Time Tasks with Backup Phasing Delay