24 search results - page 4 / 5 » The Aperiodic Multiprocessor Utilization Bound for Liquid Ta... |
JSS
2007
14 years 9 months ago
2007
A key challenge for distributed real-time and embedded (DRE) middleware is maintaining both system reliability and desired real-time performance in unpredictable environments wher...
87
Voted
RTAS
2010
IEEE
14 years 7 months ago
2010
IEEE
Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore...
89
Voted
RTSS
2006
IEEE
15 years 3 months ago
2006
IEEE
We present an optimal real-time scheduling algorithm for multiprocessors — one that satisfies all task deadlines, when the total utilization demand does not exceed the utilizat...
85
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. ...
89
Voted
ECRTS
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...