Load Balancing Azure David Rendón. Agenda Demo FAQS ¿Qué es Load Balancing? ¿Por qué Load Balancing?
On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some...
Transcript of On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some...
![Page 1: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/1.jpg)
On Some Stochastic Load Balancing Problems
Anupam Gupta
Carnegie Mellon University
Joint work withAmit Kumar, IIT Delhi
Viswanath Nagarajan, MichiganXiangkun Shen, Michigan
(appeared at SODA 2018)
1 / 26
![Page 2: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/2.jpg)
Optimization under Uncertainty
Question: How to model/solve problems with uncertainty in input/actions?I data not yet available, or obtaining exact data difficult/expensiveI actions have uncertainty in outcomesI (my talk) we only have stochastic predictions
Goal: get algos making (near)-optimal decisions given predictions.
worst-case analysis (vs. queueing perspective, cf. Mor’s talk)I Relate to performance of best strategy on worst-case instance
given predictions (vs. all-adversarial model as in competitive analysis)
2 / 26
![Page 3: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/3.jpg)
Optimization under Uncertainty
Question: How to model/solve problems with uncertainty in input/actions?I data not yet available, or obtaining exact data difficult/expensiveI actions have uncertainty in outcomesI (my talk) we only have stochastic predictions
Goal: get algos making (near)-optimal decisions given predictions.
worst-case analysis (vs. queueing perspective, cf. Mor’s talk)I Relate to performance of best strategy on worst-case instance
given predictions (vs. all-adversarial model as in competitive analysis)
2 / 26
![Page 4: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/4.jpg)
Optimization under Uncertainty
Question: How to model/solve problems with uncertainty in input/actions?I data not yet available, or obtaining exact data difficult/expensiveI actions have uncertainty in outcomesI (my talk) we only have stochastic predictions
Goal: get algos making (near)-optimal decisions given predictions.
worst-case analysis (vs. queueing perspective, cf. Mor’s talk)I Relate to performance of best strategy on worst-case instance
given predictions (vs. all-adversarial model as in competitive analysis)
2 / 26
![Page 5: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/5.jpg)
Optimization under Uncertainty
Question: How to model/solve problems with uncertainty in input/actions?I data not yet available, or obtaining exact data difficult/expensiveI actions have uncertainty in outcomesI (my talk) we only have stochastic predictions
Goal: get algos making (near)-optimal decisions given predictions.
worst-case analysis (vs. queueing perspective, cf. Mor’s talk)I Relate to performance of best strategy on worst-case instance
given predictions (vs. all-adversarial model as in competitive analysis)
2 / 26
![Page 6: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/6.jpg)
Approximation Algorithms for Stochastic Optimization
High Level Model:I Inputs random variables X1,X2, . . . with known distributionsI (for today) assume discrete distributions, explicit access to them
I outcomes not known a priori, revealed over timeI want to optimize, say, E[objective].
I many different modelsF e.g., adaptive vs. non-adaptiveF e.g., single-stage vs. multi-stage
Today: centralized load-balancing problem, minimizing E[makespan].
3 / 26
![Page 7: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/7.jpg)
Approximation Algorithms for Stochastic Optimization
High Level Model:I Inputs random variables X1,X2, . . . with known distributionsI (for today) assume discrete distributions, explicit access to them
I outcomes not known a priori, revealed over timeI want to optimize, say, E[objective].
I many different modelsF e.g., adaptive vs. non-adaptiveF e.g., single-stage vs. multi-stage
Today: centralized load-balancing problem, minimizing E[makespan].
3 / 26
![Page 8: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/8.jpg)
Approximation Algorithms for Stochastic Optimization
High Level Model:I Inputs random variables X1,X2, . . . with known distributionsI (for today) assume discrete distributions, explicit access to them
I outcomes not known a priori, revealed over timeI want to optimize, say, E[objective].
I many different modelsF e.g., adaptive vs. non-adaptiveF e.g., single-stage vs. multi-stage
Today: centralized load-balancing problem, minimizing E[makespan].
3 / 26
![Page 9: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/9.jpg)
Approximation Algorithms for Stochastic Optimization
High Level Model:I Inputs random variables X1,X2, . . . with known distributionsI (for today) assume discrete distributions, explicit access to them
I outcomes not known a priori, revealed over timeI want to optimize, say, E[objective].
I many different modelsF e.g., adaptive vs. non-adaptiveF e.g., single-stage vs. multi-stage
Today: centralized load-balancing problem, minimizing E[makespan].
3 / 26
![Page 10: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/10.jpg)
today’s problem
4 / 26
![Page 11: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/11.jpg)
(Classical) Load Balancing Problem
Schedule n jobs on m machines to minimize makespan.
Graham list-scheduling from 1966.
A
B
C
D
5 / 26
![Page 12: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/12.jpg)
(Classical) Load Balancing Problem
Schedule n jobs on m machines to minimize makespan.
Graham list-scheduling from 1966.
A
B
C
D
5 / 26
![Page 13: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/13.jpg)
(Classical) Load Balancing Problem
Schedule n jobs on m machines to minimize makespan.
Graham list-scheduling from 1966.
A
B
C
D
5 / 26
![Page 14: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/14.jpg)
(Classical) Load Balancing Problem
Schedule n jobs on m machines to minimize makespan.
Graham list-scheduling from 1966.
A
B
C
D
makespan
5 / 26
![Page 15: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/15.jpg)
much work on the deterministic problem
Simplest Model: Identical machines:I List Scheduling: 2-approx [Graham 66], PTAS [Hochbaum, Shmoys 87].
Most General: Unrelated machines:I Jobs have different sizes on different machines.
I 2-approx [Lenstra, Shmoys, Tardos 90], better for special cases.
6 / 26
![Page 16: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/16.jpg)
much work on the deterministic problem
Simplest Model: Identical machines:I List Scheduling: 2-approx [Graham 66], PTAS [Hochbaum, Shmoys 87].
Most General: Unrelated machines:I Jobs have different sizes on different machines.
I 2-approx [Lenstra, Shmoys, Tardos 90], better for special cases.
6 / 26
![Page 17: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/17.jpg)
much work on the deterministic problem
Simplest Model: Identical machines:I List Scheduling: 2-approx [Graham 66], PTAS [Hochbaum, Shmoys 87].
Most General: Unrelated machines:I Jobs have different sizes on different machines.I 2-approx [Lenstra, Shmoys, Tardos 90], better for special cases.
6 / 26
![Page 18: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/18.jpg)
Stochastic Load Balancing
Job j on machine i takes on size Xij (r.v. with known distribution)
Today: these r.v.s are independent
Find an assignment to minimize expected makespan:
E
mmaxi=1
∑j∈Ji
Xij
.? ? ? ? ?
7 / 26
![Page 19: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/19.jpg)
Stochastic Load Balancing
Job j on machine i takes on size Xij (r.v. with known distribution)
Today: these r.v.s are independent
Find an assignment to minimize expected makespan:
E
mmaxi=1
∑j∈Ji
Xij
.? ? ? ? ?
7 / 26
![Page 20: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/20.jpg)
Stochastic Load Balancing
Job j on machine i takes on size Xij (r.v. with known distribution)
Today: these r.v.s are independent
Find an assignment to minimize expected makespan:
E
mmaxi=1
∑j∈Ji
Xij
.
?
? ?
? ?
? ? ? ? ?
7 / 26
![Page 21: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/21.jpg)
Stochastic Load Balancing
Job j on machine i takes on size Xij (r.v. with known distribution)
Today: these r.v.s are independent
Find an assignment to minimize expected makespan:
E
mmaxi=1
∑j∈Ji
Xij
.? ? ? ? ?
7 / 26
![Page 22: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/22.jpg)
Stochastic Load Balancing
Job j on machine i takes on size Xij (r.v. with known distribution)
Today: these r.v.s are independent
Find an assignment to minimize expected makespan:
E
mmaxi=1
∑j∈Ji
Xij
.
minimizeexpectedmakespan
? ? ? ? ?
7 / 26
![Page 23: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/23.jpg)
Related Work: Stochastic Job Sizes
#P-hard to evaluate objective exactly
O(1)-approximation for identical machines [Kleinberg, Rabani, Tardos 00].
Better results for special classes of job size distributions [Goel, Indyk 99].
I Poisson distributed job sizes: 2-approximation.I Exponential distributed job sizes: PTAS.
What about general unrelated case?
8 / 26
![Page 24: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/24.jpg)
Related Work: Stochastic Job Sizes
#P-hard to evaluate objective exactly
O(1)-approximation for identical machines [Kleinberg, Rabani, Tardos 00].
Better results for special classes of job size distributions [Goel, Indyk 99].
I Poisson distributed job sizes: 2-approximation.I Exponential distributed job sizes: PTAS.
What about general unrelated case?
8 / 26
![Page 25: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/25.jpg)
Main Result
Theorem
An O(1)-approx algo for minimizing E[makespan] on unrelated machines.
9 / 26
![Page 26: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/26.jpg)
Roadmap and Assumptions
Identical machines case
Ideas needed for unrelated machines (and sketch of proof)
By scaling, assume E[OPTmakespan] = 1.
Assume each job is “small”: Pr[size > E [OPTmakespan]] = 0.I Easy extension to general sizes
10 / 26
![Page 27: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/27.jpg)
Roadmap and Assumptions
Identical machines case
Ideas needed for unrelated machines (and sketch of proof)
By scaling, assume E[OPTmakespan] = 1.
Assume each job is “small”: Pr[size > E [OPTmakespan]] = 0.I Easy extension to general sizes
10 / 26
![Page 28: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/28.jpg)
Roadmap and Assumptions
Identical machines case
Ideas needed for unrelated machines (and sketch of proof)
By scaling, assume E[OPTmakespan] = 1.
Assume each job is “small”: Pr[size > E [OPTmakespan]] = 0.I Easy extension to general sizes
10 / 26
![Page 29: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/29.jpg)
Deterministic Surrogate
Find deterministic quantity as a surrogate for each r.v.
Do optimization over these deterministic quantities
Surrogate = expected size?
(No!)
Bad Example
Type 1: size 1 (deterministic).
Type 2: size Bernoulli(0, 1) r.v. with p = 1√m
.
11 / 26
![Page 30: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/30.jpg)
Deterministic Surrogate
Find deterministic quantity as a surrogate for each r.v.
Do optimization over these deterministic quantities
Surrogate = expected size? (No!)
Bad Example
Type 1: size 1 (deterministic).
Type 2: size Bernoulli(0, 1) r.v. with p = 1√m
.
m−√m jobs: expectation 1
m jobs: expectation 1√m
m machines
E[mkspan] = logmlog logm
11 / 26
![Page 31: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/31.jpg)
Deterministic Surrogate
Find deterministic quantity as a surrogate for each r.v.
Do optimization over these deterministic quantities
Surrogate = expected size? (No!)
Bad Example
Type 1: size 1 (deterministic).
Type 2: size Bernoulli(0, 1) r.v. with p = 1√m
.
m−√m jobs: expectation 1
m jobs: expectation 1√m
m machines
E[mkspan] = logmlog logm
11 / 26
![Page 32: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/32.jpg)
Deterministic Surrogate
Find deterministic quantity as a surrogate for each r.v.
Do optimization over these deterministic quantities
Surrogate = expected size? (No!)
Bad Example
Type 1: size 1 (deterministic).
Type 2: size Bernoulli(0, 1) r.v. with p = 1√m
.
m−√m jobs: expectation 1
m jobs: expectation 1√m
m−√m machinesm−√m machines
√m machines
√m
√m
E[mkspan] = logmlog logm
11 / 26
![Page 33: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/33.jpg)
Deterministic Surrogate
Find deterministic quantity as a surrogate for each r.v.
Do optimization over these deterministic quantities
Surrogate = expected size? (No!)
Bad Example
Type 1: size 1 (deterministic).
Type 2: size Bernoulli(0, 1) r.v. with p = 1√m
.
m−√m jobs: expectation 1
m jobs: expectation 1√m
m−√m machinesm−√m machines
√m machines
√m
√m
E[mkspan] = logmlog logm
11 / 26
![Page 34: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/34.jpg)
Deterministic Surrogate
Find deterministic quantity as a surrogate for each r.v.
Do optimization over these deterministic quantities
Surrogate = expected size? (No!)
Bad Example
Type 1: size 1 (deterministic).
Type 2: size Bernoulli(0, 1) r.v. with p = 1√m
.
m jobs: expectation 1√m
m−√m machinesm−√m machines
√m machines
E[mkspan] = logmlog logm
m−√m machinesm−√m machines
√m machines
E[mkspan] ≤ 2 √m
√m
11 / 26
![Page 35: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/35.jpg)
Deterministic Surrogate
Find deterministic quantity as a surrogate for each r.v.
Do optimization over these deterministic quantities
Surrogate = expected size? (No!)
Bad Example
Type 1: size 1 (deterministic).
Type 2: size Bernoulli(0, 1) r.v. with p = 1√m
.
m jobs: expectation 1√m
m−√m machinesm−√m machines
√m machines
E[mkspan] = logmlog logm
m−√m machinesm−√m machines
√m machines
E[mkspan] ≤ 2 √m
√m
11 / 26
![Page 36: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/36.jpg)
Our Chief Weapon: Effective Size
12 / 26
![Page 37: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/37.jpg)
Effective Size
[Hui 88] [Elwalid, Mitra 93] [Kelly 96]
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] .
E.g., X = C w.p. 1, then βk(X ) = C .
E.g., X = Bernoulli(1/√k), then βk(X ) = log(1/
√k·k1+(1−1/
√k)·k0)
log k ≥ 1/2.
Increasing function of k
13 / 26
![Page 38: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/38.jpg)
Effective Size
[Hui 88] [Elwalid, Mitra 93] [Kelly 96]
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] =
1
log k· logE
[kX].
E.g., X = C w.p. 1, then βk(X ) = C .
E.g., X = Bernoulli(1/√k), then βk(X ) = log(1/
√k·k1+(1−1/
√k)·k0)
log k ≥ 1/2.
Increasing function of k
13 / 26
![Page 39: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/39.jpg)
Effective Size
[Hui 88] [Elwalid, Mitra 93] [Kelly 96]
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] =
1
log k· logE
[kX].
E.g., X = C w.p. 1, then βk(X ) = C .
E.g., X = Bernoulli(1/√k), then βk(X ) = log(1/
√k·k1+(1−1/
√k)·k0)
log k ≥ 1/2.
Increasing function of k
13 / 26
![Page 40: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/40.jpg)
Effective Size
[Hui 88] [Elwalid, Mitra 93] [Kelly 96]
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] =
1
log k· logE
[kX].
E.g., X = C w.p. 1, then βk(X ) = C .
E.g., X = Bernoulli(1/√k), then βk(X ) = log(1/
√k·k1+(1−1/
√k)·k0)
log k ≥ 1/2.
Increasing function of k
13 / 26
![Page 41: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/41.jpg)
Effective Size
[Hui 88] [Elwalid, Mitra 93] [Kelly 96]
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] =
1
log k· logE
[kX].
E.g., X = C w.p. 1, then βk(X ) = C .
E.g., X = Bernoulli(1/√k), then βk(X ) = log(1/
√k·k1+(1−1/
√k)·k0)
log k ≥ 1/2.
Increasing function of k
13 / 26
![Page 42: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/42.jpg)
Effective Size
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] .
m−√m jobs: size (deterministic) 1
m jobs: size Bernoulli r.v. (0, 1) w.p. 1√m
m−√m machines
m machines
effective size load: O(√m)
14 / 26
![Page 43: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/43.jpg)
Effective Size
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] .
m−√m jobs: size (deterministic) 1
m jobs: size Bernoulli r.v. (0, 1) w.p. 1√m
effective size: 1
effective size: O(1)
m−√m machines
m machines
effective size load: O(√m)
14 / 26
![Page 44: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/44.jpg)
Effective Size
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] .
m−√m jobs: size (deterministic) 1
m jobs: size Bernoulli r.v. (0, 1) w.p. 1√m
effective size: 1
effective size: O(1)
m−√m machines
√m machines
√m
√m
effective size load: O(√m)
14 / 26
![Page 45: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/45.jpg)
Effective Size
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] .
m−√m machines
√m machines
√m
√m
effective size load: O(√m)
m−√m machines
√m machines
effective size load: O(1)
m−√m machines
√m machines
effective size load: O(1)
14 / 26
![Page 46: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/46.jpg)
Effective Size
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] .
[KRT’00] For indentical machines, set k = m:
I total βm summed over all jobs ≥ m ⇒ expected OPT = Ω(1).
I βm for jobs on each machine ≤ 1 ⇒ expected makespan = O(1).
F Pr[one machine load ≥ 1 + c] ≤ (1/m)c . (next slide.)
F union bound over all machines.
I Hence O(1)-approximation.
15 / 26
![Page 47: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/47.jpg)
Effective Size
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] .
[KRT’00] For indentical machines, set k = m:
I total βm summed over all jobs ≥ m ⇒ expected OPT = Ω(1).
I βm for jobs on each machine ≤ 1 ⇒ expected makespan = O(1).
F Pr[one machine load ≥ 1 + c] ≤ (1/m)c . (next slide.)
F union bound over all machines.
I Hence O(1)-approximation.
15 / 26
![Page 48: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/48.jpg)
Effective Size
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] .
[KRT’00] For indentical machines, set k = m:
I total βm summed over all jobs ≥ m ⇒ expected OPT = Ω(1).
I βm for jobs on each machine ≤ 1 ⇒ expected makespan = O(1).
F Pr[one machine load ≥ 1 + c] ≤ (1/m)c . (next slide.)
F union bound over all machines.
I Hence O(1)-approximation.
15 / 26
![Page 49: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/49.jpg)
Effective Size
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] .
[KRT’00] For indentical machines, set k = m:
I total βm summed over all jobs ≥ m ⇒ expected OPT = Ω(1).
I βm for jobs on each machine ≤ 1 ⇒ expected makespan = O(1).
F Pr[one machine load ≥ 1 + c] ≤ (1/m)c . (next slide.)
F union bound over all machines.
I Hence O(1)-approximation.
15 / 26
![Page 50: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/50.jpg)
Effective Size
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] .
[KRT’00] For indentical machines, set k = m:
I total βm summed over all jobs ≥ m ⇒ expected OPT = Ω(1).
I βm for jobs on each machine ≤ 1 ⇒ expected makespan = O(1).
F Pr[one machine load ≥ 1 + c] ≤ (1/m)c . (next slide.)
F union bound over all machines.
I Hence O(1)-approximation.
15 / 26
![Page 51: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/51.jpg)
Effective Size
For any random variable X and parameter k > 1, define
effective size βk(X ) :=1
log k· logE
[e log k·X ] .
[KRT’00] For indentical machines, set k = m:
I total βm summed over all jobs ≥ m ⇒ expected OPT = Ω(1).
I βm for jobs on each machine ≤ 1 ⇒ expected makespan = O(1).
F Pr[one machine load ≥ 1 + c] ≤ (1/m)c . (next slide.)
F union bound over all machines.
I Hence O(1)-approximation.
15 / 26
![Page 52: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/52.jpg)
Lemma (Upper Bound)
For indep. r.v.s Y1, . . . ,Yn, if∑
i βk(Yi ) ≤ 1 then Pr[∑
i Yi ≥ 1 + c] ≤ 1kc .
Pr[∑i
Yi ≥ 1 + c] = Pr[e(log k)∑
i Yi ≥ e(log k)(1+c)] ≤ E[e(log k)∑
i Yi ]
e(log k)(1+c)
=
∏i E[e(log k)Yi ]
e(log k)(1+c)
Taking logarithms,
log Pr[∑i
Yi ≥ 1 + c] ≤ (log k) ·[∑
i
βp(Yi )− (1 + c)
]≤ (log k) · (−c).
16 / 26
![Page 53: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/53.jpg)
Lemma (Upper Bound)
For indep. r.v.s Y1, . . . ,Yn, if∑
i βk(Yi ) ≤ 1 then Pr[∑
i Yi ≥ 1 + c] ≤ 1kc .
Pr[∑i
Yi ≥ 1 + c] = Pr[e(log k)∑
i Yi ≥ e(log k)(1+c)] ≤ E[e(log k)∑
i Yi ]
e(log k)(1+c)
=
∏i E[e(log k)Yi ]
e(log k)(1+c)
Taking logarithms,
log Pr[∑i
Yi ≥ 1 + c] ≤ (log k) ·[∑
i
βp(Yi )− (1 + c)
]≤ (log k) · (−c).
16 / 26
![Page 54: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/54.jpg)
Lemma (Upper Bound)
For indep. r.v.s Y1, . . . ,Yn, if∑
i βk(Yi ) ≤ 1 then Pr[∑
i Yi ≥ 1 + c] ≤ 1kc .
Pr[∑i
Yi ≥ 1 + c] = Pr[e(log k)∑
i Yi ≥ e(log k)(1+c)] ≤ E[e(log k)∑
i Yi ]
e(log k)(1+c)
=
∏i E[e(log k)Yi ]
e(log k)(1+c)
Taking logarithms,
log Pr[∑i
Yi ≥ 1 + c] ≤ (log k) ·[∑
i
βp(Yi )− (1 + c)
]≤ (log k) · (−c).
16 / 26
![Page 55: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/55.jpg)
Effective size for Unrelated Machines Setting
17 / 26
![Page 56: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/56.jpg)
Effective Size: Unrelated Machines
Must use different k for different kinds of jobs. (Fixed k fails.)
All jobs have size∼ (0, 1) Bernoulli r.v. with p = 1√m
.
Type 1: can only be assigned to the first machine.
Type 2: can be assigned to any machine.
18 / 26
![Page 57: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/57.jpg)
Effective Size: Unrelated Machines
Must use different k for different kinds of jobs. (Fixed k fails.)
All jobs have size∼ (0, 1) Bernoulli r.v. with p = 1√m
.
Type 1: can only be assigned to the first machine.
Type 2: can be assigned to any machine.
18 / 26
![Page 58: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/58.jpg)
Effective Size: Unrelated Machines
Must use different k for different kinds of jobs. (Fixed k fails.)
All jobs have size∼ (0, 1) Bernoulli r.v. with p = 1√m
.
Type 1: can only be assigned to the first machine.
Type 2: can be assigned to any machine.
√m jobs: effective size θ
m jobs: effective size θ
m machines
effective size load:√mθ
E[mkspan] = logmlog logm
18 / 26
![Page 59: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/59.jpg)
Effective Size: Unrelated Machines
Must use different k for different kinds of jobs. (Fixed k fails.)
All jobs have size∼ (0, 1) Bernoulli r.v. with p = 1√m
.
Type 1: can only be assigned to the first machine.
Type 2: can be assigned to any machine.
√m jobs: effective size θ
m jobs: effective size θ
one machine
√m
√m
√m
m−√m− 1 machines
effective size load:√mθ
√m machines
E[mkspan] = logmlog logm
18 / 26
![Page 60: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/60.jpg)
Effective Size: Unrelated Machines
Must use different k for different kinds of jobs. (Fixed k fails.)
All jobs have size∼ (0, 1) Bernoulli r.v. with p = 1√m
.
Type 1: can only be assigned to the first machine.
Type 2: can be assigned to any machine.
√m jobs: effective size θ
m jobs: effective size θ
one machine
√m
√m
√m
m−√m− 1 machines
effective size load:√mθ
√m machines
E[mkspan] = logmlog logm
18 / 26
![Page 61: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/61.jpg)
Effective Size: Unrelated Machines
Must use different k for different kinds of jobs. (Fixed k fails.)
All jobs have size∼ (0, 1) Bernoulli r.v. with p = 1√m
.
Type 1: can only be assigned to the first machine.
Type 2: can be assigned to any machine.
one machine
√m
√m
√m
m−√m− 1 machines
effective size load:√mθ
√m machines
E[mkspan] = logmlog logm
one machine
m− 1 machines
√m
E[mkspan] = 1 + 1e
18 / 26
![Page 62: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/62.jpg)
Our Solution for Unrelated Machines
19 / 26
![Page 63: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/63.jpg)
Our Approach
1 valid inequalities using effective size.
2 (large) LP relaxation.
3 Rounding algorithm.
20 / 26
![Page 64: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/64.jpg)
Valid Inequalities
Lemma (New Valid Inequalities)
If assignment satisfies E[maxmi=1
∑j∈Ji Xij
]≤ 1, then∑
i∈K
∑j∈Ji
β|K |(Xij) ≤ O(|K |) ∀K ⊆ [m].
21 / 26
![Page 65: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/65.jpg)
LP Relaxation (cont’d)
Solve the LP using separation oracle = sorting.
I LP infeasible =⇒ optimal expected makespan > 1.F Contrapositive to above lemma.
I LP feasible =⇒ round fractional solution to satisfy subset of constraintsF Suffice to bound E[makespan], show next.
Construct instance of unrelated machines problem
Use rounding from [Lenstra, Shmoys, Tardos 92], [Shmoys, Tardos 93].
22 / 26
![Page 66: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/66.jpg)
LP Relaxation (cont’d)
Solve the LP using separation oracle = sorting.
I LP infeasible =⇒ optimal expected makespan > 1.F Contrapositive to above lemma.
I LP feasible =⇒ round fractional solution to satisfy subset of constraintsF Suffice to bound E[makespan], show next.
Construct instance of unrelated machines problem
Use rounding from [Lenstra, Shmoys, Tardos 92], [Shmoys, Tardos 93].
22 / 26
![Page 67: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/67.jpg)
LP Relaxation (cont’d)
Solve the LP using separation oracle = sorting.
I LP infeasible =⇒ optimal expected makespan > 1.F Contrapositive to above lemma.
I LP feasible =⇒ round fractional solution to satisfy subset of constraintsF Suffice to bound E[makespan], show next.
Construct instance of unrelated machines problem
Use rounding from [Lenstra, Shmoys, Tardos 92], [Shmoys, Tardos 93].
22 / 26
![Page 68: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/68.jpg)
Valid Inequalities
Lemma (New Valid Inequalities)
If assignment satisfies E[maxmi=1
∑j∈Ji Xij
]≤ 1, then∑
i∈K
∑j∈Ji
β|K |(Xij) ≤ O(|K |) ∀K ⊆ [m].
23 / 26
![Page 69: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/69.jpg)
“Pre-Rounding” Algorithm1 remaining machines L← [m], ` = |L|.2 while ` > 0:
1 “class ` machines: L′ ← i ∈ L : zi (`) ≤ 1.2 pij ← β`(Xij) for machines i ∈ L′, all jobs.3 L← L \ L′ and ` = |L|.
machines
jobs
total β5 value ≤ 5
pi,j ← β2(Ti,j)
total β5 value ≤ 5
∑i∈K
β|K |(Xij ) · yij ≤ |K |, ∀K ⊆ [m]
24 / 26
![Page 70: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/70.jpg)
“Pre-Rounding” Algorithm
1 remaining machines L← [m], ` = |L|.2 while ` > 0:
1 “class ` machines: L′ ← i ∈ L : zi (`) ≤ 1.2 pij ← β`(Xij) for machines i ∈ L′, all jobs.3 L← L \ L′ and ` = |L|.
total β5 value ≤ 5
pi,j ← β2(Ti,j)
∑i∈K
β|K |(Xij ) · yij ≤ |K |, ∀K ⊆ [m]
24 / 26
![Page 71: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/71.jpg)
“Pre-Rounding” Algorithm
1 remaining machines L← [m], ` = |L|.2 while ` > 0:
1 “class ` machines: L′ ← i ∈ L : zi (`) ≤ 1.2 pij ← β`(Xij) for machines i ∈ L′, all jobs.3 L← L \ L′ and ` = |L|.
total β5 value ≤ 5β5 ≤ 1
5
pi,j ← β2(Ti,j)
∑i∈K
β|K |(Xij ) · yij ≤ |K |, ∀K ⊆ [m]
24 / 26
![Page 72: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/72.jpg)
“Pre-Rounding” Algorithm
1 remaining machines L← [m], ` = |L|.2 while ` > 0:
1 “class ` machines: L′ ← i ∈ L : zi (`) ≤ 1.2 pij ← β`(Xij) for machines i ∈ L′, all jobs.3 L← L \ L′ and ` = |L|.
total β5 value ≤ 5
pi,j ← β5(Ti,j)
5
∑i∈K
β|K |(Xij ) · yij ≤ |K |, ∀K ⊆ [m]
24 / 26
![Page 73: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/73.jpg)
“Pre-Rounding” Algorithm
1 remaining machines L← [m], ` = |L|.2 while ` > 0:
1 “class ` machines: L′ ← i ∈ L : zi (`) ≤ 1.2 pij ← β`(Xij) for machines i ∈ L′, all jobs.3 L← L \ L′ and ` = |L|.
total β4 value ≤ 45
pi,j ← β2(Ti,j)
∑i∈K
β|K |(Xij ) · yij ≤ |K |, ∀K ⊆ [m]
24 / 26
![Page 74: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/74.jpg)
“Pre-Rounding” Algorithm
1 remaining machines L← [m], ` = |L|.2 while ` > 0:
1 “class ` machines: L′ ← i ∈ L : zi (`) ≤ 1.2 pij ← β`(Xij) for machines i ∈ L′, all jobs.3 L← L \ L′ and ` = |L|.
total β4 value ≤ 4β4 ≤ 1
5 4 4
pi,j ← β2(Ti,j)
∑i∈K
β|K |(Xij ) · yij ≤ |K |, ∀K ⊆ [m]
24 / 26
![Page 75: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/75.jpg)
“Pre-Rounding” Algorithm
1 remaining machines L← [m], ` = |L|.2 while ` > 0:
1 “class ` machines: L′ ← i ∈ L : zi (`) ≤ 1.2 pij ← β`(Xij) for machines i ∈ L′, all jobs.3 L← L \ L′ and ` = |L|.
total β4 value ≤ 4
pi,j ← β4(Ti,j)
5 4 4
∑i∈K
β|K |(Xij ) · yij ≤ |K |, ∀K ⊆ [m]
24 / 26
![Page 76: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/76.jpg)
“Pre-Rounding” Algorithm
1 remaining machines L← [m], ` = |L|.2 while ` > 0:
1 “class ` machines: L′ ← i ∈ L : zi (`) ≤ 1.2 pij ← β`(Xij) for machines i ∈ L′, all jobs.3 L← L \ L′ and ` = |L|.
total β2 value ≤ 25 4 4
pi,j ← β2(Ti,j)
∑i∈K
β|K |(Xij ) · yij ≤ |K |, ∀K ⊆ [m]
24 / 26
![Page 77: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/77.jpg)
“Pre-Rounding” Algorithm
1 remaining machines L← [m], ` = |L|.2 while ` > 0:
1 “class ` machines: L′ ← i ∈ L : zi (`) ≤ 1.2 pij ← β`(Xij) for machines i ∈ L′, all jobs.3 L← L \ L′ and ` = |L|.
total β2 value ≤ 25 4 4
β2 ≤ 1
2 2
pi,j ← β2(Ti,j)
∑i∈K
β|K |(Xij ) · yij ≤ |K |, ∀K ⊆ [m]
24 / 26
![Page 78: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/78.jpg)
“Pre-Rounding” Algorithm
1 remaining machines L← [m], ` = |L|.2 while ` > 0:
1 “class ` machines: L′ ← i ∈ L : zi (`) ≤ 1.2 pij ← β`(Xij) for machines i ∈ L′, all jobs.3 L← L \ L′ and ` = |L|.
total β2 value ≤ 25 4 4 2 2
pi,j ← β2(Ti,j)
∑i∈K
β|K |(Xij ) · yij ≤ |K |, ∀K ⊆ [m]
24 / 26
![Page 79: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/79.jpg)
“Pre-Rounding” Algorithm
1 remaining machines L← [m], ` = |L|.2 while ` > 0:
1 “class ` machines: L′ ← i ∈ L : zi (`) ≤ 1.2 pij ← β`(Xij) for machines i ∈ L′, all jobs.3 L← L \ L′ and ` = |L|.
5 4 4 2 2
pi,j ← β2(Ti,j)
total β5 value ≤ 5
∑i∈K
β|K |(Xij ) · yij ≤ |K |, ∀K ⊆ [m]
24 / 26
![Page 80: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/80.jpg)
Analysis Sketch
LP gives fractional sol. for unrelated machines (target load B = 1).
Round it: 2-approx rounded assignment Jimi=1 satisfies:∑j∈Ji
β`(i)(Xij) ≤ 2, ∀i ∈ [m]
Pr[machine i load ≥ 2 + c] ≤ 1`(i)c .
Union bound over machines gives
Pr[maxload > 2 + c] ≤∑i
1
`(i)c≤∑i
1
ic 1.
Can also bound E[maxload ].
25 / 26
![Page 81: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/81.jpg)
Analysis Sketch
LP gives fractional sol. for unrelated machines (target load B = 1).
Round it: 2-approx rounded assignment Jimi=1 satisfies:∑j∈Ji
β`(i)(Xij) ≤ 2, ∀i ∈ [m]
Pr[machine i load ≥ 2 + c] ≤ 1`(i)c .
Union bound over machines gives
Pr[maxload > 2 + c] ≤∑i
1
`(i)c≤∑i
1
ic 1.
Can also bound E[maxload ].
25 / 26
![Page 82: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/82.jpg)
Analysis Sketch
LP gives fractional sol. for unrelated machines (target load B = 1).
Round it: 2-approx rounded assignment Jimi=1 satisfies:∑j∈Ji
β`(i)(Xij) ≤ 2, ∀i ∈ [m]
Pr[machine i load ≥ 2 + c] ≤ 1`(i)c .
Union bound over machines gives
Pr[maxload > 2 + c] ≤∑i
1
`(i)c≤∑i
1
ic 1.
Can also bound E[maxload ].
25 / 26
![Page 83: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/83.jpg)
wrapup
O(1)-approx for stochastic load balancing on unrelated machines.I Main tool: effective size
Extensions (in the paper):I O(1)-approx for budgeted makespan minimization.I O( q
log q)-approx for q-norm minimization.
F Now O(1)-approx by M. Molinaro (forthcoming)
Tighter analysis (2?) even for identical machines?
Incorporate routing aspects?
Data center issues?
Thank you!
26 / 26
![Page 84: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/84.jpg)
wrapup
O(1)-approx for stochastic load balancing on unrelated machines.I Main tool: effective size
Extensions (in the paper):I O(1)-approx for budgeted makespan minimization.I O( q
log q)-approx for q-norm minimization.
F Now O(1)-approx by M. Molinaro (forthcoming)
Tighter analysis (2?) even for identical machines?
Incorporate routing aspects?
Data center issues?
Thank you!
26 / 26
![Page 85: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/85.jpg)
wrapup
O(1)-approx for stochastic load balancing on unrelated machines.I Main tool: effective size
Extensions (in the paper):I O(1)-approx for budgeted makespan minimization.I O( q
log q)-approx for q-norm minimization.
F Now O(1)-approx by M. Molinaro (forthcoming)
Tighter analysis (2?) even for identical machines?
Incorporate routing aspects?
Data center issues?
Thank you!
26 / 26
![Page 86: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/86.jpg)
wrapup
O(1)-approx for stochastic load balancing on unrelated machines.I Main tool: effective size
Extensions (in the paper):I O(1)-approx for budgeted makespan minimization.I O( q
log q)-approx for q-norm minimization.
F Now O(1)-approx by M. Molinaro (forthcoming)
Tighter analysis (2?) even for identical machines?
Incorporate routing aspects?
Data center issues?
Thank you!
26 / 26
![Page 87: On Some Stochastic Load Balancing Problemssamir/DCscheduling18/slides/TTIC-Gupta.pdfOn Some Stochastic Load Balancing Problems Anupam Gupta Carnegie Mellon University Joint work with](https://reader036.fdocuments.in/reader036/viewer/2022062604/5fc04874a92a374a2174ad33/html5/thumbnails/87.jpg)
wrapup
O(1)-approx for stochastic load balancing on unrelated machines.I Main tool: effective size
Extensions (in the paper):I O(1)-approx for budgeted makespan minimization.I O( q
log q)-approx for q-norm minimization.
F Now O(1)-approx by M. Molinaro (forthcoming)
Tighter analysis (2?) even for identical machines?
Incorporate routing aspects?
Data center issues?
Thank you!
26 / 26