Sciweavers

93 search results - page 1 / 19
» Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm
Sort
View
IPPS
2007
IEEE
13 years 11 months ago
Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
Hakem Beitollahi, Seyed Ghassem Miremadi, Geert De...
ISLPED
2007
ACM
123views Hardware» more  ISLPED 2007»
13 years 6 months ago
Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
Sushu Zhang, Karam S. Chatha, Goran Konjevod
RTS
2008
134views more  RTS 2008»
13 years 3 months ago
On earliest deadline first scheduling for temporal consistency maintenance
A real-time object is one whose state may become invalid with the passage of time. A temporal validity interval is associated with the object state, and the real-time object is te...
Ming Xiong, Qiong Wang, Krithi Ramamritham
SAC
2009
ACM
13 years 11 months ago
An implementation of the earliest deadline first algorithm in Linux
Recently, many projects have been started to introduce some real-time mechanisms into general purpose operating systems (GPOS) in order to make them capable of providing the users...
Dario Faggioli, Michael Trimarchi, Fabio Checconi
PRDC
2006
IEEE
13 years 10 months ago
Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
Hakem Beitollahi, Geert Deconinck