Sciweavers

3934 search results - page 2 / 787
» Approximate Schedulability Analysis
Sort
View
DAM
2006
88views more  DAM 2006»
13 years 6 months ago
Domination analysis for minimum multiprocessor scheduling
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
Gregory Gutin, Tommy R. Jensen, Anders Yeo
EUROPAR
2008
Springer
13 years 8 months ago
Bi-objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines
We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-...
Emmanuel Jeannot, Erik Saule, Denis Trystram
IPPS
2006
IEEE
14 years 8 days ago
Schedulability analysis of non-preemptive recurring real-time tasks
The recurring real-time task model was recently proposed as a model for real-time processes that contain code with conditional branches. In this paper, we present a necessary and ...
Sanjoy K. Baruah, Samarjit Chakraborty
INFOCOM
2009
IEEE
14 years 27 days ago
Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
Liqun Fu, Soung Chang Liew, Jianwei Huang
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 6 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat