A new fault-tolerant technique for improving schedulability in multiprocessor real-time systems

dc.contributor.author Al-Omari, R.
dc.contributor.author Somani, Arun
dc.contributor.author Govindarasu, Manimaran
dc.contributor.author Govindarasu, Manimaran
dc.contributor.department Electrical and Computer Engineering
dc.date 2021-03-05T16:52:47.000
dc.date.accessioned 2021-04-30T00:45:25Z
dc.date.available 2021-04-30T00:45:25Z
dc.date.copyright Mon Jan 01 00:00:00 UTC 2001
dc.date.embargo 2000-01-01
dc.date.issued 2001-01-01
dc.description.abstract <p>In real-time systems, tasks have deadlines to be met despite the presence of faults. Primary-Backup (PB) scheme is one of the most common schemes that has been employed for fault-tolerant scheduling of real-time tasks, wherein each task has two versions and the versions are scheduled on two different processors with time exclusion. There have been techniques proposed for improving schedulability of the PB-based scheduling. One of the more popular ones include Backup-Backup (BB) overloading, wherein two or more backups can share/overlap in time on a processor. In this paper we propose a new schedulability enhancing technique, called primary-backup (PB) overloading, in which the primary of a task can share/overlap in time with the backup of another task an a processor. The intuition is that, for both primary and backup of a task, the PB-overloading can assign an earlier start time than that of the BB-overloading, thereby increasing the schedulability. We conduct schedulability and reliability analysis of PB- and BB-overloading techniques through simulation and analytical studies. Our studies show that PB-overloading offers better schedulability (25% increase in the guarantee ratio) than that of BB-overloading, and offers reliability comparable to that of BB-overloading. The proposed PB-overloading is a general technique that can be employed in any static or dynamic fault-tolerant scheduling algorithm.</p>
dc.description.comments <p>This is a manuscript of a proceeding published as Al-Omari, R., Arun K. Somani, and G. Manimaran. "A new fault-tolerant technique for improving schedulability in multiprocessor real-time systems." In <em>Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001</em>, IEEE, 2001. DOI: <a href="https://doi.org/10.1109/IPDPS.2001.924967" target="_blank">10.1109/IPDPS.2001.924967</a>. Posted with permission.</p>
dc.format.mimetype application/pdf
dc.identifier archive/lib.dr.iastate.edu/ece_conf/173/
dc.identifier.articleid 1168
dc.identifier.contextkey 21899079
dc.identifier.s3bucket isulib-bepress-aws-west
dc.identifier.submissionpath ece_conf/173
dc.identifier.uri https://dr.lib.iastate.edu/handle/20.500.12876/104695
dc.language.iso en
dc.source.bitstream archive/lib.dr.iastate.edu/ece_conf/173/2001_SomaniArun_NewFault.pdf|||Fri Jan 14 21:20:14 UTC 2022
dc.source.uri 10.1109/IPDPS.2001.924967
dc.subject.disciplines Digital Communications and Networking
dc.subject.disciplines Systems and Communications
dc.subject.keywords fault tolerant computing
dc.subject.keywords processor scheduling
dc.subject.keywords real-time systems
dc.subject.keywords multiprocessing systems
dc.title A new fault-tolerant technique for improving schedulability in multiprocessor real-time systems
dc.type article
dc.type.genre conference
dspace.entity.type Publication
relation.isAuthorOfPublication f9016a06-26bf-4947-a6f9-f529ccbb8f2a
relation.isOrgUnitOfPublication a75a044c-d11e-44cd-af4f-dab1d83339ff
Original bundle
Now showing 1 - 1 of 1
168.9 KB
Adobe Portable Document Format