Randomized Algorithms for Online Vector Load Balancing

We study randomized algorithms for the online vector bin packing and vector scheduling problems. For vector bin packing, we achieve a competitive ratio of O(d1/B), where d is the number of dimensions and B the size of a bin. This improves the previous bound of O(d1/(B−1)) by a polynomial factor, and is tight up to logarithmic factors. For vector scheduling, we show a lower bound of [EQUATION] on the competitive ratio of randomized algorithms, which is the first result for randomized algorithms and is asymptotically tight. Finally, we analyze the widely used "power of two choices' algorithm for vector scheduling, and show that its competitive ratio is [EQUATION], which is optimal up to the additive O(log log n) term that also appears in the scalar version of this algorithm.

[1]  Yossi Azar,et al.  Online Lower Bounds via Duality , 2016, SODA.

[2]  Yves Robert,et al.  Introduction to Scheduling , 2009, CRC computational science series.

[3]  Jan Vondrák,et al.  Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[4]  Nikhil Bansal,et al.  Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds , 2014, Algorithmica.

[5]  Guihai Chen,et al.  Online vector scheduling and generalized load balancing , 2014, J. Parallel Distributed Comput..

[6]  Tamir Tassa,et al.  Vector assignment schemes for asymmetric settings , 2005, Acta Informatica.

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

[8]  Leah Epstein,et al.  On variable sized vector packing , 2003, Acta Cybern..

[9]  Gerhard J. Woeginger,et al.  On-line bin packing — A restricted survey , 1995, Math. Methods Oper. Res..

[10]  Michael Mitzenmacher,et al.  The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[11]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[12]  Sanjoy K. Baruah,et al.  Mixed-Criticality Scheduling of Sporadic Task Systems , 2011, ESA.

[13]  Alberto Caprara,et al.  A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing , 2009, SIAM J. Comput..

[14]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..

[15]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[16]  Kirk Pruhs,et al.  Online scheduling , 2003 .

[17]  Kunal Talwar,et al.  Balanced allocations: the weighted case , 2007, STOC '07.

[18]  Tamir Tassa,et al.  Vector assignment problems: a general framework , 2002, J. Algorithms.

[19]  Leah Epstein,et al.  Multidimensional Packing Problems , 2018, Handbook of Approximation Algorithms and Metaheuristics.

[20]  Yossi Azar,et al.  Tight bounds for online vector bin packing , 2013, STOC '13.

[21]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[22]  Berthold Vöcking,et al.  Balanced allocations: the heavily loaded case , 2000, STOC '00.

[23]  Amos Fiat,et al.  Packing Small Vectors , 2016, SODA.

[24]  Andrew Chi-Chih Yao,et al.  Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.

[25]  Adam Meyerson,et al.  Online Multidimensional Load Balancing , 2013, APPROX-RANDOM.

[26]  Micah Adler,et al.  Parallel randomized load balancing , 1995, STOC '95.

[27]  Nikhil Bansal,et al.  Improved Approximation for Vector Bin Packing , 2016, SODA.

[28]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[29]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[30]  Y. Peres,et al.  The (1 + β)-choice process and weighted balls-into-bins , 2010, SODA '10.

[31]  Zengjian Hu,et al.  On weighted balls-into-bins games , 2005, Theor. Comput. Sci..

[32]  Vincenzo Bonifaci,et al.  Scheduling Unrelated Machines of Few Different Types , 2012, ArXiv.

[33]  Jean-Charles Billaut,et al.  Introduction to scheduling , 2002 .

[34]  Berthold Vöcking,et al.  How asymmetry helps load balancing , 1999, JACM.

[35]  Janardhan Kulkarni,et al.  Tight Bounds for Online Vector Scheduling , 2014, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[36]  Yuval Peres,et al.  The (1 + beta)-Choice Process and Weighted Balls-into-Bins , 2010, SODA.

[37]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[38]  Yossi Azar.  On-line Load Balancing , 1996, Online Algorithms.

[39]  Jirí Sgall,et al.  Online Bin Packing: Old Algorithms and New Results , 2014, CiE.

[40]  Michael Mitzenmacher,et al.  Load Balancing and Density Dependent Jump Markov Processes EXTENDED ABSTRACT , 1996, FOCS 1996.