14th Scheduling for Large Scale Systems Workshop

›8:30 (30min)

Breakfast

› Hall Leyteire

8:30 - 9:00 (30min)

Breakfast

Hall Leyteire

›9:00 (1h15)

Scheduling
Taieb Znati

› Amphitheatre Leyteire

9:00 - 10:15 (1h15)

Scheduling

Amphitheatre Leyteire

Taieb Znati

› Scheduling at the edge - Clement Mommessin, Inria 09:00-09:25 (25min)

› Adaptive Parallelism for Coupled, Multithreaded Message-Passing Programs - Dorian Arnold, Emory University [Atlanta, GA] 09:25-09:50 (25min)

› Experiences in the design of a malleable and I/O-aware scheduler - David Singh, Carlos III University of Madrid 09:50-10:15 (25min)

›10:15 (30min)

Break

› Hall Leyteire

10:15 - 10:45 (30min)

Break

Hall Leyteire

›10:45 (1h15)

Resilience
Frédéric Vivien

› Amphitheatre Leyteire

10:45 - 12:00 (1h15)

Resilience

Amphitheatre Leyteire

Frédéric Vivien

› Partial Redundancy and In-memory checkpoints Under Heterogeneous Failure Likelihoods - Rami Melhem, The University of Pittsburgh 10:45-11:10 (25min)

› A nice little scheduling problem - Yves Robert, Laboratoire de lÍnformatique du Parallélisme, Innovative Computing Laboratory [Knoxville] 11:10-11:35 (25min)

› Fault-Tolerance Strategies for HPC Platforms - Thomas Herault, University of Tennessee 11:35-12:00 (25min)

›12:00 (1h30)

Lunch

› Hall Leyteire

12:00 - 13:30 (1h30)

Lunch

Hall Leyteire

›13:30 (1h15)

Job Scheduling

› Amphitheatre Leyteire

13:30 - 14:45 (1h15)

Job Scheduling

Amphitheatre Leyteire

› Adaptive scheduling of HPC applications using malleability and dynamic migration. - ALBERTO CASCAJO, University Carlos III of Madrid - Jesus Carretero, University Carlos III of Madrid 13:30-13:55 (25min)

› Reservation Strategies for Stochastic Jobs - 13:55-14:20 (25min)

› Strategies for deploying stochastic HPC applications on large-scale systems - Ana Gainaru, Vanderbilt University [Nashville] 14:20-14:45 (25min)

›14:45 (1h15)

Discussions

14:45 - 16:00 (1h15)

Discussions

In Amphitheatre Leyteire and nearby rooms

›16:00 (30min)

Coffee break

› Hall Leyteire

16:00 - 16:30 (30min)

Coffee break

Hall Leyteire

›16:30 (1h15)

Graphs
Esmond Ng

› Amphitheatre Leyteire

16:30 - 17:45 (1h15)

Graphs

Amphitheatre Leyteire

Esmond Ng

› Parallel Algorithms for Dynamic Networks - Sanjukta Bhowmick, University of North Texas 16:30-16:55 (25min)

› Is Acyclic Directed Graph Partitioning Effective for Locality-Aware Scheduling? - Ümit Çatalyürek, Georgia Institute of Technology 16:55-17:20 (25min)

› Graph coloring and sparse matrix multiplication: a hammer and an incompatible nail - Aydin Buluc, Lawrence Berkeley National Laboratory 17:20-17:45 (25min)

›19:30 (2h30)

Dinner - Chez Frida

19:30 - 22:00 (2h30)

Dinner - Chez Frida