Influence of heavy-tailed distributions on load balancing

1
New NSF ALADDIN PROBE
Scheduling in Multiserver Systems
Mor Harchol-Balter (CS) Takayuki Osogami
(CS) Alan Scheller-Wolf (GSIA)
Research Funding Theory of Computation NSF PD
98-2860 Workshop Funding NSF Aladdin
2
Fundamental OPEN Problem 1 Cycle Stealing
3
Fundamental OPEN Problem 2 Priority Queueing in
Server Farms
H
jobs
L
H
H
L
H
4
Fundamental OPEN Problem 3 Priority Reservations
H
Hs have priority
jobs
L
H
H
L
H
Ls have priority
L
5
The difficulty 2D-infinite chain
6
Our Idea
2D-infinite chain
1D-infinite chain
INTRACTABLE
TRACTABLE
7
Our 1D-infinite Chain
8
NSF ALADDIN Workshop on Multiserver scheduling
Date April 10,11 2004 Location CMU campus
TOPICS
Performance modeling for server farms Load
balancing Scheduling algorithms and
prioritization Queueing analysis Workload
characterization for multiservers Computational
methods for multi-dimensional optimization Impact
of heavy-tailed queues in multiserver systems

INVITEES
Lehoczky(CMU) Prabhakar (Stanford) Buzen (BMC
Software) Biersack (Eurecom, France) Coffman
(Columbia) Nain (France) Towsley (Amherst)
Borst (Eurecom, France) Whitt (Columbia)
Daley (Canberra Australia) Williamson (Calgary,
Canada) Squillante (IBM) Williams (UCSD)
Wakerly (Cisco Systems) Tse (Berkeley)
Trivedi (Duke) Bertsimas (MIT) Takagi
(Japan) Massey (Princeton) Feng (Nagoya,
Japan) Karatza (Greece) Bonomi (ATT)
Reiman (Bell Labs) Crovella (BU) Glynn
(Stanford).
9
BACKUP
10
Prior work Long history, little success

• Prior to 1980 Many papers Truncate the
  chain.

• Early 1980s

Fayolle Iasnogoradski Konheim Meilijson Melkman
...
Very complex integrals. Solvable
Coupled processor version. Only Exp. Job Sizes

• 1980s, 90s, 2000s

Cohen Boxma Borst Uitert Jelenkovic ...
Very, very complex integrals. UNSOLVABLE
Coupled processor version . General Job Sizes

• Cycle stealing problem KEYNOTE ADDRESS,
  Performance 2002.