An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs

We give the first polynomial-time approximation scheme (PTAS) for the stochastic load balancing problem when the job sizes follow Poisson distributions. This improves upon the 2-approximation algorithm due to Goel and Indyk (FOCS'99). Moreover, our approximation scheme is an efficient PTAS that has a running time double exponential in $1/\epsilon$ but nearly-linear in $n$, where $n$ is the number of jobs and $\epsilon$ is the target error. Previously, a PTAS (not efficient) was only known for jobs that obey exponential distributions (Goel and Indyk, FOCS'99). Our algorithm relies on several probabilistic ingredients including some (seemingly) new results on scaling and the so-called "focusing effect" of maximum of Poisson random variables which might be of independent interest.

[1]  Klaus Jansen.  An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables , 2009, ICALP.

[2]  Lin Chen,et al.  On the optimality of approximation schemes for the classical scheduling problem , 2014, SODA.

[3]  D. A. Darling.  On the Supremum of a Certain Gaussian Process , 1983 .

[4]  Ashish Goel,et al.  Stochastic load balancing and related problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[5]  C. Anderson.  Extreme value theory for a class of discrete distributions with applications to some stochastic processes , 1970 .

[6]  K. P. Choi.  On the medians of gamma distributions and an equation of Ramanujan , 1994 .

[7]  H. Robbins.  A Remark on Stirling’s Formula , 1955 .

[8]  M. Talagrand.  Majorizing measures: the generic chaining , 1996 .

[9]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[10]  N. Alon,et al.  Approximation schemes for scheduling on parallel machines , 1998 .

[11]  Klaus Jansen,et al.  On Integer Programming and Convolution , 2019, ITCS.

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

[13]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[14]  Marco Molinaro,et al.  Stochastic ℓp Load Balancing and Moment Problems via the L-Function Method , 2018, SODA.

[15]  J. Hüsler,et al.  Maxima of Poisson-like variables and related triangular arrays , 1997 .

[16]  Klaus Jansen,et al.  Closing the Gap for Makespan Scheduling via Sparsification Techniques , 2016, ICALP.

[17]  Fabián A. Chudak,et al.  Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds , 1997, SODA '97.

[18]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[19]  Michael A. Bender,et al.  An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines , 1998, IPCO.

[20]  Ravi Kannan,et al.  Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..

[21]  Yuval Rabani,et al.  Allocating bandwidth for bursty connections , 1997, STOC '97.

[22]  Amit Kumar,et al.  Stochastic Load Balancing on Unrelated Machines , 2018, SODA.

[23]  T. Prellberg,et al.  A note on the distribution of the maximum of a set of Poisson random variables , 2009 .

[24]  David B. Shmoys,et al.  A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1988, SIAM J. Comput..

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