20 search results - page 2 / 4 » Worst-case utilization bound for EDF scheduling on real-time... |
RTAS
2008
IEEE
14 years 4 days 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...
PARELEC
2002
IEEE
13 years 10 months ago
2002
IEEE
In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing ele...
ECRTS
2000
IEEE
13 years 10 months ago
2000
IEEE
ESA
2009
Springer
14 years 9 days ago
2009
Springer
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
PRDC
2006
IEEE
13 years 11 months ago
2006
IEEE
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...