Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding

Conference

International Parallel and Distributed Processing Symposium (IPDPS 2000)

Publication Version

Accepted Manuscript

Link to Published Version

https://doi.org/10.1007/3-540-45591-4_177

Publication Date

2000

Journal or Book Title

Parallel and Distributed Processing

First Page

1291

Last Page

1295

DOI

10.1007/3-540-45591-4_177

Conference Title

International Parallel and Distributed Processing Symposium (IPDPS 2000)

Conference Date

May 1-5, 2000

City

Cancun, Mexico

Abstract

Many time-critical applications require dynamic scheduling with predictable performance. Tasks corresponding to these applications have deadlines to be met despite the presence of faults. In this paper, we propose a technique called dynamic grouping, to be used with backup overloading in a primary-backup based fault-tolerant dynamic scheduling algorithm in multiprocessor real-time systems. In dynamic grouping, the processors are dynamically grouped into logical groups in order to achieve efficient overloading of backups, there by improving the schedulability. We compare the performance of dynamic grouping with that of static grouping and no-grouping schemes through extensive simulation studies and show the effectiveness of dynamic grouping.

Comments

This is a post-peer-review, pre-copyedit version of a proceeding published as Al-Omari R., Manimaran G., Somani A.K. (2000) An Efficient Backup-Overloading for Fault-Tolerant Scheduling of Real-Time Tasks. In: Rolim J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. The final authenticated version is available online at DOI: 10.1007/3-540-45591-4_177. Posted with permission.

Copyright Owner

Springer-Verlag Berlin Heidelberg

Language

en

File Format

application/pdf

Published Version

Share

Article Location

 
COinS