3934 search results - page 1 / 787 » Approximate Schedulability Analysis |
RTSS
2002
IEEE
13 years 9 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
CJ
2008
13 years 4 months ago
2008
We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a ...
SIGMETRICS
2002
ACM
13 years 4 months ago
2002
ACM
ECRTS
2004
IEEE
13 years 8 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
ICPP
1998
IEEE
13 years 9 months ago
1998
IEEE
This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-ca...