Sciweavers

841 search results - page 94 / 169
» Job Scheduling in Rings
Sort
View
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 6 months ago
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
Philippe Baptiste, Peter Brucker, Marek Chrobak, C...
TNC
2004
132views Education» more  TNC 2004»
15 years 7 months ago
Distributed Encoding Environment based on Grids and IBP Infrastructure
This paper introduces an environment for distributed video transcoding based on Grid computing infrastructure and Internet Backplane Protocol storage infrastructure. A model for s...
Petr Holub, Lukás Hejtmánek
MOR
2000
90views more  MOR 2000»
15 years 6 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
EGC
2005
Springer
15 years 12 months ago
The Design and Implementation of the KOALA Co-allocating Grid Scheduler
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multipl...
Hashim H. Mohamed, Dick H. J. Epema
ICALP
2003
Springer
15 years 11 months ago
Algorithmic Aspects of Bandwidth Trading
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph ...