1 workshop on multiserver scheduling (worms) carnegie mellon university pittsburgh, pa april 18 and...
TRANSCRIPT
1
WORkshop on Multiserver Scheduling (WORMS)
Carnegie Mellon University Pittsburgh, PA
April 18 and 19, 2004
Funded by NSF ALADDIN and Tepper
WELCOME EVERYONE!
2
Multiserver systems are everywhere!
Server farms, Supercomputing centers,Network of Workstations (NOWs),Internet, Call centers,Manufacturing/service centers, etc.
Why?
• Lots of jobs one server is not enough • Cheap, cost-effective solution• Easily scalable• Flexible
3
But multiserver systemsare not understood …
Performancequestions
Policyquestio
ns
Comparison
with singleserver
behavior
4
• Example: Analysis of scheduling policies
SRPT
M/GI/1
EASY
SRPT
M/GI/2
VERY HARD
But multiserver systemsare not understood …
Performancequestions
Policyquestio
ns
Comparison
with singleserver
behavior
5
• Example: What’s the best task assignment policy?
But multiserver systemsare not understood …
Performancequestions
Policyquestio
ns
Comparison
with singleserver
behavior
PS
PS
6
But multiserver systemsare not understood …
Performancequestions
Policyquestio
ns
Comparison
with singleserver
behavior• Example: What’s the best threshold policy?
7
But multiserver systemsare not understood …
Performancequestions
Policyquestio
ns
Comparison
with singleserver
behavior• How to dynamically place servers?
8
• What parallels can we draw between multiserver and single server? What lessons stay same?
But multiserver systemsare not understood …
Performancequestions
Policyquestio
ns
Comparison
with singleserver
behavior
9
1 fast
versus
FIFO FIFO
M/GI/1 M/GI/3
But multiserver systemsare not understood …
Performancequestions
Policyquestio
ns
Comparison
with singleserver
behavior
many slow
10
1 fast vs. many slow
versus
C2
FIFO FIFO
M/GI/1 M/GI/3
11
But multiserver systemsare not understood …
Performancequestions
Policyquestio
ns
Comparison
with singleserver
behavior
We want to hear your favorite multiserver questions during discussions!
12
Program Sunday morning
Dimensionality Reduction
9:00 Mor Harchol-Balter, CMU9:30 Alan Scheller-Wolf, CMU10:00 DISCUSSION
10:30 COFFEE BREAK & INTRODUCTIONS
Multiserver Queues & Distributed Systems
11:00 Helen Karatza, Aristotle U. Thessaloniki, Greece11:30 Daryl Daley, Australian National University12:00 DISCUSSION
12:30 LUNCH
13
Program Sunday afternoon
Fluid Modeling Techniques & Applications
1:30 R. Srikant, U. Illinois, Urbana-Champaign2:00 Peter Glynn, Stanford U.2:30 DISCUSSION
3:00 COFFEE BREAK
Resource Pooling
3:30 Ruth Williams, U. California, San Diego4:00 Mark Squillante, IBM T. J. Watson4:30 DISCUSSION
5:00 RIDE TO HOTEL.6:30 PICKUP FOR DINNER AT HOTEL LOBBY.
14
Program Monday morning
Scheduling Algorithms
9:00 Balaji Prabhakar, Stanford U.9:30 John Lehoczky, CMU10:00 Ed Coffman, Columbia U.10:30 DISCUSSION
11:15 TOUR OF CMU CAMPUS12:15 LUNCH
8:30 BAGELS
15
Program Monday afternoon
Scheduling Web & Networks
1:30 Carey Williamson, U. Calgary, Canada2:00 Ernst Biersack, Institut EURECOM, France2:30 DISCUSSION
3:00 COFFEE BREAK
Call Center Design
3:30 Bill Massey, Princeton U. 4:00 Ward Whitt, Columbia U.4:30 DISCUSSION
5:00 WRAP-UP DISCUSSION6:00 PICKUP FOR DINNER AT MY HOUSE.
16
More Info:
• WORMS 04 Internet Café Wean Hall 8219
• Reimbursements See Charlotte Yano
• Copies of papers See Charlotte Yano
• Mor’s office: Wean Hall 8119
• Want to set up meetings with other faculty or students at CMU, please send email to me and Charlotte.
WELCOME EVERYONE!