Sciweavers

83 search results - page 8 / 17
» Scheduling of Fault-Tolerant Embedded Systems with Soft and ...
Sort
View
RTCSA
1999
IEEE
13 years 12 months ago
Scheduling a Steel Plant with Timed Automata
Scheduling in an environment with constraints of many different types is known to be a hard problem. We tackle this problem for an integrated steel plant in Ghent, Belgium, using ...
Ansgar Fehnker
RTCSA
2008
IEEE
14 years 2 months ago
Schedulability Analysis for Non-Preemptive Tasks under Strict Periodicity Constraints
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non...
Omar Kermia, Yves Sorel
ECRTS
2007
IEEE
14 years 2 months ago
Tardiness Bounds for FIFO Scheduling on Multiprocessors
FIFO scheduling is often considered to be inappropriate for scheduling workloads that are subject to timing constraints. However, FIFO is implemented in many generalpurpose OSs, a...
Hennadiy Leontyev, James H. Anderson
ECRTS
2009
IEEE
13 years 5 months ago
Reader-Writer Synchronization for Shared-Memory Multiprocessor Real-Time Systems
Reader preference, writer preference, and task-fair readerwriter locks are shown to cause undue blocking in multiprocessor real-time systems. A new phase-fair reader-writer lock i...
Björn B. Brandenburg, James H. Anderson
ISOLA
2010
Springer
13 years 6 months ago
A Scalable Approach for the Description of Dependencies in Hard Real-Time Systems
During the design iterations of embedded systems, the schedulability analysis is an important method to verify whether the real-time constraints are satisfied. In order to achieve...
Steffen Kollmann, Victor Pollex, Kilian Kempf, Fra...