3934 search results - page 7 / 787 » Approximate Schedulability Analysis |
INFOCOM
1997
IEEE
14 years 18 days ago
1997
IEEE
A packet scheduler in a quality-of-service QoS network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implemen...
SPAA
2010
ACM
13 years 8 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
EMSOFT
2009
Springer
14 years 3 months ago
2009
Springer
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...