Sciweavers

254 search results - page 9 / 51
» Approximation Algorithms for Scheduling Parallel Jobs
Sort
View
117
Voted
COLOGNETWENTE
2008
15 years 2 months ago
Special Cases of Online Parallel Job Scheduling
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, ...
Johann Hurink, Jacob Jan Paulus
101
Voted
SWAT
2004
Springer
142views Algorithms» more  SWAT 2004»
15 years 6 months ago
Getting the Best Response for Your Erg
We consider the speed scaling problem of minimizing the average response time of a collection of dynamically released jobs subject to a constraint A on energy used. We propose an ...
Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woe...
CCGRID
2006
IEEE
15 years 7 months ago
SAHA: A Scheduling Algorithm for Security-Sensitive Jobs on Data Grids
Security-sensitive applications that access and generate large data sets are emerging in various areas such as bioinformatics and high energy physics. Data grids provide data-inte...
Tao Xie 0004, Xiao Qin
120
Voted
HPDC
2008
IEEE
15 years 1 months ago
A two-level scheduler to dynamically schedule a stream of batch jobs in large-scale grids
This paper describes the study conducted to design and evaluate a two-level on-line scheduler to dynamically schedule a stream of sequential and multi-threaded batch jobs on large...
Marco Pasquali, Ranieri Baraglia, Gabriele Capanni...
115
Voted
LATIN
2000
Springer
15 years 4 months ago
Approximation Algorithms for Flexible Job Shop Problems
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...