554 search results - page 18 / 111 » Approximability of OFDMA Scheduling |
ECCC
2000
14 years 9 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
RTCSA
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
ICC
2009
IEEE
14 years 7 months ago
2009
IEEE
Abstract This paper proposes an analytical method to evaluate the delay violation probability of traffic flows with statistical Quality-of-Service (QoS) guarantees in a Generalize...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
STACS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...