Cited By
View all- Eberle FGupta AMegow NMoseley BZhou R(2023)Configuration Balancing for Stochastic RequestsInteger Programming and Combinatorial Optimization10.1007/978-3-031-32726-1_10(127-141)Online publication date: 21-Jun-2023
Stochastic Load Balancing on Unrelated Machines
Pages 115 - 133
Abstract
We consider the problem of makespan minimization on unrelated machines when job sizes are stochastic. The goal is to find a fixed assignment of jobs to machines, to minimize the expected value of the maximum load over all the machines. For the identical-machines special case when the size of a job is the same across all machines, a constant-factor approximation algorithm has long been known. Our main result is the first constant-factor approximation algorithm for the general case of unrelated machines. This is achieved by (i) formulating a lower bound using an exponential-size linear program that is efficiently computable and (ii) rounding this linear program while satisfying only a specific subset of the constraints that still suffice to bound the expected makespan. We also consider two generalizations. The first is the budgeted makespan minimization problem, where the goal is to minimize the expected makespan subject to scheduling a target number (or reward) of jobs. We extend our main result to obtain a constant-factor approximation algorithm for this problem. The second problem involves q-norm objectives, where we want to minimize the expected q-norm of the machine loads. Here we give an O(q/log q)-approximation algorithm, which is a constant-factor approximation for any fixed q.
References
[1]
Azar Y, Epstein A (2005) Convex programming for scheduling unrelated parallel machines. Proc. 37th Annual ACM Sympos. Theory Comput. (ACM, New York), 331–337.
[2]
Balinski ML, Russakoff A (1974) On the assignment polytope. SIAM Rev. 16(4):516–525.
[3]
Elwalid AI, Mitra D (1993) Effective bandwidth of general Markovian traffic sources and admission control of high speed networks. IEEE/ACM Trans. Networking 1(3):329–343.
[4]
Goel A, Indyk P (1999) Stochastic load balancing and related problems. Proc. 40th Annual Sympos. Foundations Comput. (IEEE, Washington, DC), 579–586.
[5]
Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell System Tech. J. 45(9):1563–1581.
[6]
Gupta V, Moseley B, Uetz M, Xie Q (2017) Stochastic online scheduling on unrelated machines. Eisenbrand F, Koenemann J, eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 10328 (Springer International Publishing, Cham, Switzerland), 228–240.
[7]
Hochbaum DS, Shmoys DB (1987) Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM 34(1):144–162.
[8]
Hochbaum DS, Shmoys DB (1988) A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comput. 17(3):539–551.
[9]
Hui JY (1988) Resource allocation for broadband networks. IEEE J. Selected Areas Comm. 6(3):1598–1608.
[10]
Ibragimov R, Sharakhmetov S (2001) The best constant in the Rosenthal inequality for nonnegative random variables. Statist. Probab. Lett. 55(4):367–376.
[11]
Im S, Moseley B, Pruhs K (2015) Stochastic scheduling of heavy-tailed jobs. 32nd Internat. Sympos. Theoret. Aspects Comput. Sci., Leibniz International Proceedings in Informatics, vol. 30 (Schloss Dagstuhl–Leibniz Center for Informatics, Wadern, Germany), 474–486.
[12]
Johnson WB, Schechtman G, Zinn J (1985) Best constants in moment inequalities for linear combinations of independent and exchangeable random variables. Ann. Probab. 13(1):234–253.
[13]
Kelly FP (1996) Notes on effective bandwidths. Kelly FP, Zachary S, Ziedins IB, eds. Stochastic Networks: Theory and Applications (Oxford University Press, Oxford, UK), 141–168.
[14]
Kim JH, Vu VH (2000) Concentration of multivariate polynomials and its applications. Combinatorica 20(3):417–434.
[15]
Kleinberg J, Rabani Y, Tardos E (2000) Allocating bandwidth for bursty connections. SIAM J. Comput. 30(1):191–217.
[16]
Latała R (1997) Estimation of moments of sums of independent real random variables. Ann. Probab. 25(3):1502–1513.
[17]
Lenstra JK, Shmoys DB, Tardos É (1990) Approximation algorithms for scheduling unrelated parallel machines. Math. Programming 46(1–3):259–271.
[18]
Li J, Deshpande A (2011) Maximizing expected utility for stochastic combinatorial optimization problems. Proc. IEEE 52nd Annual Sympos. Foundations Comput. Sci. (IEEE Computer Society, Washington, DC), 797–806.
[19]
Li J, Yuan W (2013) Stochastic combinatorial optimization via Poisson approximation. Proc. 45th Annual ACM Sympos. Theory Comput. (ACM, New York), 971–980.
[20]
Megow N, Uetz M, Vredeveld T (2006) Models and algorithms for stochastic online scheduling. Math. Oper. Res. 31(3):513–525.
[21]
Möhring RH, Schulz AS, Uetz M (1999) Approximation in stochastic scheduling: the power of LP-based priority policies. J. ACM 46(6):924–942.
[22]
Molinaro M (2019) Stochastic lp load balancing and moment problems via the L-function method. Proc. 30th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 343–354.
[23]
Pinedo M (2004) Offline deterministic scheduling, stochastic scheduling, and online deterministic scheduling. Leung JYT, ed. Handbook of Scheduling: Algorithms, Models, and Performance Analysis (Chapman and Hall/CRC, Boca Raton, FL).
[24]
Rosenthal HP (1970) On the subspaces of Lp (p > 2) spanned by sequences of independent random variables. Israel J. Math. 8:273–303.
[25]
Schudy W, Sviridenko M (2012) Concentration and moment inequalities for polynomials of independent random variables. Proc. 23rd Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 437–446.
[26]
Shmoys DB, Tardos É (1993) An approximation algorithm for the generalized assignment problem. Math. Programming 62(1–3):461–474.
Index Terms
- Stochastic Load Balancing on Unrelated Machines
Index terms have been assigned to the content through auto-classification.
Recommendations
Stochastic load balancing on unrelated machines
SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete AlgorithmsWe consider the problem of makespan minimization: i.e., scheduling jobs on machines to minimize the maximum load. For the deterministic case, good approximations are known even when the machines are unrelated. However, the problem is not well-understood ...
Minimizing Flow-Time on Unrelated Machines
STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of ComputingWe consider some classical flow-time minimization problems in the unrelated machines setting. In this setting, there is a set of m machines and a set of n jobs, and each job j has a machine dependent processing time of pij on machine i. The flow-time of ...
Scheduling on Unrelated Machines under Tree-Like Precedence Constraints
We present polylogarithmic approximations for the R|prec|C max and R|prec|∑j w j C j problems, when the precedence constraints are “treelike”—i.e., when the undirected graph underlying the precedences is a forest. These are the first non-trivial ...
Comments
Information & Contributors
Information
Published In
Copyright © 2020, INFORMS.
Publisher
INFORMS
Linthicum, MD, United States
Publication History
Published: 01 February 2021
Accepted: 13 December 2019
Received: 28 December 2018
Author Tags
Author Tags
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025
Other Metrics
Citations
Cited By
View all- Eberle FGupta AMegow NMoseley BZhou R(2023)Configuration Balancing for Stochastic RequestsInteger Programming and Combinatorial Optimization10.1007/978-3-031-32726-1_10(127-141)Online publication date: 21-Jun-2023