80 search results - page 3 / 16 » A tight lower bound for job scheduling with cancellation |
GLVLSI
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper we present a novel and fast estimation technique that produces tight latency lower bounds for Data Flow Graphs representing time critical segments of the application...
WAOA
2004
Springer
14 years 21 days ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— This paper considers the scheduling problem in wireless networks. We focus on prioritized maximal scheduling, where a maximal scheduler chooses the links in an order specified...
SIGECOM
2004
ACM
14 years 24 days ago
2004
ACM
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...