Sciweavers

720 search results - page 30 / 144
» Machine scheduling with resource dependent processing times
Sort
View
RTSS
2005
IEEE
15 years 5 months ago
Trading End-to-End Latency for Composability
The periodic resource model for hierarchical, compositional scheduling abstracts task groups by resource requirements. We study this model in the presence of dataflow constraints...
Slobodan Matic, Thomas A. Henzinger
LATIN
2010
Springer
15 years 1 months ago
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
Eric Angel, Evripidis Bampis, Nicolas Thibault
COR
2011
14 years 6 months ago
Size-reduction heuristics for the unrelated parallel machines scheduling problem
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job diï¬...
Luis Fanjul-Peyro, Rubén Ruiz
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
15 years 5 months ago
On the Robustness of Graham's Algorithm for Online Scheduling
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
Michael Gatto, Peter Widmayer
RIDE
1998
IEEE
15 years 4 months ago
On Periodic Resource Scheduling for Continuous Media Databases
The Enhanced Pay-Per-View (EPPV) model for providing continuous-media services associates with each continuous-media clip a display frequency that depends on the clip's popula...
Minos N. Garofalakis, Banu Özden, Abraham Sil...