Sciweavers

254 search results - page 5 / 51
» Approximation Algorithms for Scheduling Parallel Jobs
Sort
View
DISOPT
2008
118views more  DISOPT 2008»
13 years 7 months ago
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
Asaf Levin, Michal Penn
IPPS
2010
IEEE
13 years 5 months ago
Varying bandwidth resource allocation problem with bag constraints
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...
CORR
2007
Springer
131views Education» more  CORR 2007»
13 years 7 months ago
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
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...
Guolong Lin, Rajmohan Rajaraman
IPPS
1999
IEEE
13 years 11 months ago
On the Design and Evaluation of Job Scheduling Algorithms
Abstract. In this paper we suggest a strategy to design job scheduling systems. To this end, we first split a scheduling system into three components: Scheduling policy, objective ...
Jochen Krallmann, Uwe Schwiegelshohn, Ramin Yahyap...
JDA
2008
93views more  JDA 2008»
13 years 7 months ago
On-line scheduling of parallel jobs on two machines
We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case ...
Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochu...