Sciweavers

254 search results - page 3 / 51
» Approximation Algorithms for Scheduling Parallel Jobs
Sort
View
IFIPTCS
2010
13 years 3 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...
PPAM
2005
Springer
13 years 11 months ago
Two Level Job-Scheduling Strategies for a Computational Grid
Abstract. We address parallel jobs scheduling problem for computational GRID systems. We concentrate on two-level hierarchy scheduling: at the first level broker allocates computa...
Andrei Tchernykh, Juan Manuel Ramírez, Arut...
ANOR
2010
130views more  ANOR 2010»
13 years 3 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
IPPS
2006
IEEE
13 years 11 months ago
Multisite co-allocation algorithms for computational grid
Efficient multisite job scheduling facilitates the cooperation of multi-domain massively parallel processor systems in a computing grid environment. However, co-allocation, hetero...
Weizhe Zhang, A. M. K. Cheng, Mingzeng Hu
STOC
2005
ACM
156views Algorithms» more  STOC 2005»
14 years 6 months ago
Convex programming for scheduling unrelated parallel machines
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
Yossi Azar, Amir Epstein