![Page 1: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/1.jpg)
An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem
Angelo Monti1, Paolo Penna2, Riccardo Silvestri1
1 Università di Roma “La Sapienza”2 Università di Salerno
![Page 2: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/2.jpg)
Outline
• Online load balancing
• Caccetta-Häggkvist conjecture
• Connection between them
![Page 3: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/3.jpg)
Online load balancing
processors
task (weight, subset, duration)
![Page 4: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/4.jpg)
Online load balancing
Example: linear topologies [Bar-Noy et al’99]
best worst
![Page 5: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/5.jpg)
Online load balancing
How good is greedy?
Example: linear topologies [Bar-Noy et al’99]
best worst8 tasks
![Page 6: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/6.jpg)
Online load balancing
How good is greedy?
Example: linear topologies [Bar-Noy et al’99]
best worst4 tasks
![Page 7: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/7.jpg)
Online load balancing
How good is greedy?
Example: linear topologies [Bar-Noy et al’99]
worst2 tasks
![Page 8: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/8.jpg)
Online load balancing
How good is greedy?
Example: linear topologies [Bar-Noy et al’99]
worst1 task
(log n)-competitive
![Page 9: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/9.jpg)
Online load balancing
modified-greedy
Example: linear topologies [Bar-Noy et al’99]
worst8 tasks4 tasks2 tasks1 task
4-competitive
More general approach [Crescenzi et al’03]
![Page 10: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/10.jpg)
Online load balancing
More general approach [Crescenzi et al’03]:
“structure” comp(“structure”)
1. Competitive ratio of modified-greedy2. Simple local algorithm3. Combinatorial approach
![Page 11: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/11.jpg)
Online load balancing
More general approach [Crescenzi et al’03]:
“structure” comp(“structure”)
Optimal for “nice structures”• identical, linerar, hierarchical
![Page 12: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/12.jpg)
Online load balancing
More general approach [Crescenzi et al’03]:
“structure” comp(“structure”)
Optimal for “nice structures”• identical, linerar, hierarchical
How good on the “uniform” case?
“Equivalent” to a fundamental question
in graph theory
![Page 13: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/13.jpg)
Caccetta-Häggkvist Conjecture
Every directed graph on n nodes and minimum outdegree d has a directed cycle of length at most n/d
![Page 14: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/14.jpg)
Caccetta-Häggkvist Conjecture
Every directed graph on n nodes and minimum outdegree d has a directed cycle of length at most n/d
?
![Page 15: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/15.jpg)
Modified-greedy algorithms
S1,…, Si,…, Sm
S1’,…, Si
’,…, Sm’
R1,…, Ri,…, Rm
problem “structure”
Ri = Sj : Sj’ intersects Si
’
How good is modified-greedy?
maxi |Ri|/|Si’|
[Crescenzi et al’03]
![Page 16: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/16.jpg)
The “uniform” case
How good is modified-greedy?
comp(n,s)
Each task can be assigned to exactly s processors
ApplyCrescenzi et al’03
to uniform case
S1,…, Si,…, Sm
S1’,…, Si
’,…, Sm’
R1,…, Ri,…, Rm
Ri = Sj : Sj’ intersects Si
’
minS’ maxi |Ri|/|Si’| =
complete hypergraph
“best”
1. Limitations of this method
2. Local vs global
![Page 17: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/17.jpg)
The “uniform” case
Each task can be assigned to exactly s processors
Trivial upper bound comp(n,s) n/s greedy
Cannot be improved unless CH-Conjecture fails
![Page 18: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/18.jpg)
The “uniform” case
Each task can be assigned to exactly s processors
Cannot be improved unless CH-Conjecture fails
all large
![Page 19: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/19.jpg)
The “uniform” case
Each task can be assigned to exactly s processors
Cannot be improved unless CH-Conjecture fails
![Page 20: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/20.jpg)
The “uniform” case
Each task can be assigned to exactly s processors
Cannot be improved unless CH-Conjecture fails
high cost
equivalent!
![Page 21: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/21.jpg)
High cost
d
n-d
Caccetta-Häggkvist ConjectureEvery directed graph on n nodes and minimum outdegree d has a directed cycle of length at most n/d
A directed graph on n nodesand minimum outdegree dno directed cycle of length at most s
(n – n/s)
n/ss
![Page 22: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/22.jpg)
High cost
What are these algorithms?“Blind” algorithms
“fixed” allocation
![Page 23: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/23.jpg)
Conclusions
• Analyze “blind” algorithms– Diffult, interesting question
• Modified-greedy algos are “useless” for uniform instances
• Maybe a different view of the CH-Conjecture– Procedure ot check the conjecture?
![Page 24: An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem Angelo Monti 1, Paolo Penna 2, Riccardo Silvestri 1 1 Università](https://reader036.vdocument.in/reader036/viewer/2022062716/56649e0d5503460f94af6a06/html5/thumbnails/24.jpg)
Thank You