554 search results - page 14 / 111 » Approximability of OFDMA Scheduling |
EUROPAR
2008
Springer
14 years 11 months ago
2008
Springer
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-...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
JPDC
2007
14 years 9 months ago
2007
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
CJ
2008
14 years 9 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 ...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— Adaptive transmission techniques including transmit beamforming, precoding, and opportunistic scheduling offer high spectral efficiency when channel state information ...