5 search results - page 1 / 1 » Cluster scheduling for real-time systems: utilization bounds... |
72
Voted
RTS
2011
14 years 5 months ago
2011
96
Voted
RTSS
2006
IEEE
15 years 5 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...
97
Voted
ECRTS
2005
IEEE
15 years 4 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...
96
Voted
RTSS
2005
IEEE
15 years 4 months ago
2005
IEEE
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
99
Voted
RTAS
2008
IEEE
15 years 5 months ago
2008
IEEE
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...