Scheduling Jobs on Heterogeneous Platforms

In the context of grid scheduling we consider a scheduling scenario, where parallel jobs have to be scheduled non-preemptively on heterogeneous computational platforms of processors. The speed of the processors may differ among the platforms and the jobs are submitted simultaneously or over time and cannot run across multiple platforms. We focus on the target of minimizing the total makespan, i.e. the global latest finishing time of a job. In this paper we present an AFPTAS for the problem without release times and show how to generalize our result to malleable jobs and jobs with release times.

[1]  Klaus Jansen,et al.  Approximation Algorithms for Multiple Strip Packing , 2009, WAOA.

[2]  David B. Shmoys,et al.  Approximation schemes for constrained scheduling problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[3]  Klaus Jansen,et al.  Rectangle packing with one-dimensional resource augmentation , 2009, Discret. Optim..

[4]  Domenico Talia,et al.  Euro-Par 2010 - Parallel Processing , 2010, Lecture Notes in Computer Science.

[5]  Jan van Leeuwen,et al.  Algorithms — ESA '94 , 1994, Lecture Notes in Computer Science.

[6]  Leonid Khachiyan,et al.  Approximate Max-Min Resource Sharing for Structured Concave Optimization , 2000, SIAM J. Optim..

[7]  Guochuan Zhang,et al.  Online multiple-strip packing , 2009, Theor. Comput. Sci..

[8]  Eugene L. Lawler,et al.  Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[9]  Ronald L. Graham,et al.  Bounds for Multiprocessor Scheduling with Resource Constraints , 1975, SIAM J. Comput..

[10]  A. Steinberg,et al.  A Strip-Packing Algorithm with Absolute Performance Bound 2 , 1997, SIAM J. Comput..

[11]  Klaus Jansen,et al.  Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 , 2008, ICALP.

[12]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[13]  Sergey Zhuk.  Approximate algorithms to pack rectangles into several strips , 2006 .

[14]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[15]  Joseph Y.-T. Leung,et al.  Complexity of Scheduling Parallel Task Systems , 1989, SIAM J. Discret. Math..

[16]  Klaus Jansen,et al.  Efficient Approximation and Online Algorithms - Recent Progress on Classical Combinatorial Optimization Problems and New Applications , 2006, Efficient Approximation and Online Algorithms.

[17]  Klaus Jansen,et al.  Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks , 1999, SODA '99.

[18]  Uwe Schwiegelshohn,et al.  Online scheduling in grids , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[19]  Klaus Jansen,et al.  Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme , 2004, Algorithmica.

[20]  Klaus Jansen,et al.  Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications , 2006, Efficient Approximation and Online Algorithms.

[21]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[22]  Ingo Schiermeyer,et al.  Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles , 1994, ESA.

[23]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[24]  Klaus Jansen,et al.  Approximation Algorithms for Scheduling Parallel Jobs , 2010, SIAM J. Comput..

[25]  Klaus Jansen,et al.  Approximating the Non-contiguous Multiple Organization Packing Problem , 2010, IFIP TCS.

[26]  Klaus Jansen,et al.  A (5 / 3 + ε ) -Approximation for Strip Packing ∗ , 2011 .

[27]  Claire Mathieu,et al.  A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem , 2000, Math. Oper. Res..

[28]  Klaus Jansen,et al.  A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling , 2010, Euro-Par.

[29]  Klaus Jansen,et al.  New Approximability Results for 2-Dimensional Packing Problems , 2007, MFCS.

[30]  Denis Trystram,et al.  Efficient approximation algorithms for scheduling malleable tasks , 1999, SPAA '99.

[31]  Andrei Tchernykh,et al.  Two Level Job-Scheduling Strategies for a Computational Grid , 2005, PPAM.