Fault-Tolerant Static Scheduling for Real-Time Distributed Embedded Systems (Extended Abstract)

Authors:
Affiliations:
Venue:
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Year:
2001

Citing 4
Cited 2

Optimized rapid prototyping for real-time embedded heterogeneous multiprocessors

CODES '99 Proceedings of the seventh international workshop on Hardware/software codesign
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Synchronous Programming of Reactive Systems

Synchronous Programming of Reactive Systems
Dependability: Basic Concepts and Terminology

Dependability: Basic Concepts and Terminology

QoS management for real-time DataBases in embedded systems

Proceedings of the 2008 Euro American Conference on Telematics and Information Systems
Tools for programming, code generation, and design

Embedded Systems Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: We present in this paper a heuristic for producing automatically a distributed fault-tolerant schedule of a given data-flow algorithm onto a given distributed architecture. The faults considered are processor failures, with a fail-silent behavior. Fault-tolerance is achieved with the software redundancy of computations and the time redundancy of data-dependencies.