Sciweavers

1453 search results - page 205 / 291
» Scheduling for Embedded Real-Time Systems
Sort
View
RTCSA
2000
IEEE
15 years 8 months ago
Scheduling optional computations in fault-tolerant real-time systems
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
Pedro Mejía-Alvarez, Hakan Aydin, Daniel Mo...
ICST
2008
IEEE
15 years 10 months ago
Scheduling Timed Modules for Correct Resource Sharing
Real-time embedded systems typically include concurrent tasks of different priorities with time-dependent operations accessing common resources. In this context, unsynchronized pa...
Cristina Cerschi Seceleanu, Paul Pettersson, Hans ...
ISLPED
2003
ACM
95views Hardware» more  ISLPED 2003»
15 years 9 months ago
Power-aware scheduling of conditional task graphs in real-time multiprocessor systems
We propose a novel power-aware task scheduling algorithm for DVS-enabled real-time multiprocessor systems. Unlike the existing algorithms, the proposed DVS algorithm can handle co...
Dongkun Shin, Jihong Kim
ECRTS
2000
IEEE
15 years 8 months ago
Tolerating faults while maximizing reward
The imprecise computation(IC) model is a general scheduling framework, capable of expressing the precision vs. timeliness trade-off involved in many current real-time applications...
Hakan Aydin, Rami G. Melhem, Daniel Mossé
132
Voted
ECRTS
2010
IEEE
15 years 5 months ago
Preemption Points Placement for Sporadic Task Sets
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
Marko Bertogna, Giorgio C. Buttazzo, Mauro Marinon...