An algorithm for automatically obtaining distributed and fault-tolerant static schedules

Girault, Alain; Kalla, Hamoudi; Sighireanu, Mihaela; Sorel, Yves

doi:10.1109/dsn.2003.1209927

Cited by 32 publications

(36 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…One of the limitations of the previously proposed task-allocation algorithms (Oh and Son 1994;Bertossi et al 1999;Chen et al 2007;Kim et al 2010;Girault et al 2003) is that these algorithms do not make any distinction between job errors and processor failures. Most of the earlier works considered mainly partitioned scheduling to tolerate particularly permanent faults, which (implicitly) can also tolerate transient faults; but at the expense of space redundancy since all backups of a task are allocated to distinct cores.…”

Section: Fault-tolerant Real-time Schedulingmentioning

confidence: 99%

“…There are several works on fault-tolerant scheduling based on partitioned and global approaches for multiprocessors (Oh and Son 1994;Bertossi et al 1999;Hashimoto et al 2000;Chen et al 2007;Kim et al 2010;Berten et al 2006;Girault et al 2003;Liberato et al 1999;Pathan and Jonsson 2011a;Huang et al 2011). In partitioned fault-tolerant scheduling, a task-allocation algorithm assigns the primary and backups of each task to distinct processors 1 at design time.…”

Section: Fault-tolerant Real-time Schedulingmentioning

confidence: 99%

“…The work by Girault et al (2003) considers allocation of only active backups to tolerate processor failures and is not applicable to sporadic tasks. Isovic and Fohler (2000) consider time-triggered scheduling of sporadic tasks.…”

Section: Related Workmentioning

confidence: 99%

“…Many interesting table-driven fault-tolerant scheduling are addressed in Girault et al (2003), Isovic and Fohler (2000), Pop et al (2009), Kandasamy et al (2003). The scheduling table for each processor is generated offline, which sometimes could be challenging if task parameters are 'badly' related.…”

Section: Related Workmentioning

confidence: 99%

“…In summary, many of the previous works on fault-tolerant scheduling on multiprocessors consider a relatively restricted error/fault model by assuming, for example, that (i) the inter-arrival time of two errors/faults must be separated by a minimum distance (Ghosh et al 1994;Tsuchiya et al 1995;Liberato et al 1999), (ii) at most one error affect each task (Liberato et al 1999;Ghosh et al 1994;Bertossi et al 1999), (iii) tolerating task error is same as tolerating processor failures (Oh and Son 1994;Bertossi et al 1999;Chen et al 2007;Kim et al 2010;Girault et al 2003), and (iv) consider only active backups (Girault et al 2003) or only passive backups (Pathan and Jonsson 2011a).…”

Section: Related Workmentioning

confidence: 99%

See 4 more Smart Citations

Real-time scheduling algorithm for safety-critical systems on faulty multicore environments

Pathan

2016

Real-Time Syst

View full text Add to dashboard Cite

An algorithm (called FTM) for scheduling of real-time sporadic tasks on a multicore platform is proposed. Each task has a deadline by which it must complete its non-erroneous execution. The FTM algorithm executes backups in order to recover from errors caused by non-permanent and permanent hardware faults. The worst-case schedulability analysis of FTM algorithm is presented considering an applicationlevel error model, which is independent of the stochastic behavior of the underlying hardware-level fault model. Then, the stochastic behavior of hardware-level fault model is plugged in to the analysis to derive the probability of meeting all the deadlines. Such probabilistic guarantee is the level of assurance (i.e., reliability) regarding the correct functional and timing behaviors of the system. One of the salient features of FTM algorithm is that it executes some backups in active redundancy to exploit the parallel multicore architecture while other backups passively to avoid unnecessary execution of too many active backups. This paper also proposes a scheme to determine for each task the number of backups that should run in active redundancy in order to increase the probability of meeting all the deadlines. The effectiveness of the proposed approach is demonstrated using an example application.

show abstract

Section: Fault-tolerant Real-time Schedulingmentioning

confidence: 99%

Section: Fault-tolerant Real-time Schedulingmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

Real-time scheduling algorithm for safety-critical systems on faulty multicore environments

Pathan

2016

Real-Time Syst

View full text Add to dashboard Cite

show abstract

An Active Replication Scheme That Tolerates Failures in Distributed Embedded Real-Time Systems

Girault

Kalla

Sorel

2004

IFIP International Federation for Information Processing

View full text Add to dashboard Cite

Abstract:Embedded real-time systems are being increasingly used in a major part of critical applications. In these systems, critical real-time constraints must be satisfied even in the presence of failures. In this paper, we present a new method-based on graph transformation that introduces fault-tolerance in building embedded real-time systems. The proposed method targets distributed architecture and can tolerate a fixed number of arbitrary processors and communication links failures. Because of the resource limitation in embedded systems, our method uses a software-based replication technique to provide fault-tolerance. Finally, since we use graph transformation to perform replication, our method may be used by any off-line distribution-scheduling algorithm to generate a fault-tolerant distributed schedule.

show abstract

Transient Processor/Bus Fault Tolerance for Embedded Systems

Girault

Kalla

Sorel

2006

From Model-Driven Design to Resource Management for Distributed Embedded Systems

View full text Add to dashboard Cite

We propose an approach to build fault-tolerant distributed real-time embedded systems. From a given system description (application algorithm and architecture) and a given fault hypothesis (type and number of faults to be tolerated), we generate automatically a static fault-tolerant multiprocessor schedule of the algorithm components on the target architecture, v^hich minimizes the schedule length, and tolerates transient faults of both processors and communication media. Our approach is dedicated to heterogeneous architectures with multiple processors linked by several shared buses. It is based on hybrid redundancy and data fragmentation strategies, which allow fast fault detection and handling. This scheduling problem is NP-hard and we rely on a heuristic algorithm to obtain efficiently an approximate solution. Our simulation results show that our approach generally reduces the schedule length overhead.

show abstract

An algorithm for automatically obtaining distributed and fault-tolerant static schedules

Abstract: Our goal is to automatically obtain a distributed and fault-tolerant embedded system: distributed because the system must run on a distributed architecture; fault-tolerant because the system is critical.

Cited by 32 publications

References 19 publications

Real-time scheduling algorithm for safety-critical systems on faulty multicore environments

Real-time scheduling algorithm for safety-critical systems on faulty multicore environments

An Active Replication Scheme That Tolerates Failures in Distributed Embedded Real-Time Systems

Transient Processor/Bus Fault Tolerance for Embedded Systems

Contact Info

Product

Resources

About