14th Scheduling for Large Scale Systems Workshop

Wed. 26

Thu. 27

Fri. 28

08:00

09:00

10:00

11:00

12:00

13:00

14:00

15:00

16:00

17:00

18:00

19:00

20:00

21:00

22:00

Welcoming talk

9:30 - 9:45 (15min)

Welcoming talk

Amphitheatre Leyteire

Organizers

Plenary talk

9:45 - 10:30 (45min)

Plenary talk

Amphitheatre Leyteire

Olivier Beaumont

› HPC-BigData Convergence: What to do when scientific data becomes too big? - Franck Cappello, Argonne National Laboratory [Lemont] 09:45-10:30 (45min)

Break

10:30 - 11:00 (30min)

Break

Hall Leyteire

Numerical Algorithm

11:00 - 12:40 (1h40)

Numerical Algorithm

Amphitheatre Leyteire

Grégoire Pichon

› A 2D Task-based Fan-both Factorization Algorithm for Sparse Symmetric Matrices - Mathias Jacquelin, Lawrence Berkeley National Laboratory 11:00-11:25 (25min)

› Improving nested task-parallelism in the LU Factorization of H-Matrices - Rocío Carratalá-Sáez, Universitat Jaume I 11:25-11:50 (25min)

› Extending the STF model to design a hierarchical direct solver for distributed memory machines with manycore nodes - Cedric Augonnet, CEA/DAM 11:50-12:15 (25min)

› Wine or Brandy? Block low rank and block separable matrices - Cleve Ashcraft, Livermore Software Technology Corporation 12:15-12:40 (25min)

Lunch

12:40 - 14:00 (1h20)

Lunch

Hall Leyteire

Scheduling

14:00 - 15:15 (1h15)

Scheduling

Amphitheatre Leyteire

› Independent tasks on 2 resources with co-scheduling effects - Lionel Eyraud-Dubois, Inria Bordeaux - Sud-Ouest 14:00-14:25 (25min)

› Optimal Memory-aware Backpropagation of Deep Join Networks - Julien Herrmann, Inria Bordeaux 14:25-14:50 (25min)

› Computing latency of a real-time system modeled by a Synchronous Dataflow Graph - Alix Munier Kordon, Laboratoire dÍnformatique de Paris 6 14:50-15:15 (25min)

Discussions

15:15 - 15:40 (25min)

Discussions

In Amphitheatre Leyteyre and rooms nearby

Coffee break

15:40 - 16:10 (30min)

Coffee break

Hall Leyteire

Performance Evaluation

16:10 - 17:50 (1h40)

Performance Evaluation

Amphitheatre Leyteire

Abdou Guermouche

› A Comparison of Random Task Graph Generation Methods for Scheduling Problems - Louis-Claude Canon, Département d'Informatique des Systèmes Complexes (FEMTO-ST/DISC) 16:10-16:35 (25min)

› Faithful and Efficient Simulation of High Performance Linpack - Arnaud Legrand, Laboratoire d'Informatique de Grenoble 16:35-17:00 (25min)

› Is your scheduling good? How would you know? - Anthony Danalis, University of Tennesee 17:00-17:25 (25min)

› An overview of uncore frequency impact on performance and power consumption - Amina Guermouche, Telecom SudParis 17:25-17:50 (25min)

Dinner - St-Once

19:30 - 22:00 (2h30)

Dinner - St-Once

Breakfast

8:30 - 9:00 (30min)

Breakfast

Hall Leyteire

Scheduling

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)

Break

10:15 - 10:45 (30min)

Break

Hall Leyteire

Resilience

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)

Lunch

12:00 - 13:30 (1h30)

Lunch

Hall Leyteire

Job Scheduling

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)

Discussions

14:45 - 16:00 (1h15)

Discussions

In Amphitheatre Leyteire and nearby rooms

Coffee break

16:00 - 16:30 (30min)

Coffee break

Hall Leyteire

Graphs

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)

Dinner - Chez Frida

19:30 - 22:00 (2h30)

Dinner - Chez Frida

Breakfast

8:30 - 9:00 (30min)

Breakfast

Hall Leyteire

Numerical Algorithm

9:00 - 10:40 (1h40)

Numerical Algorithm

Amphitheatre Leyteire

Théo Mary

› Sparse tensor ordering - Bora Uçar, ROMA 09:00-09:25 (25min)

› Optimal tensor-matrix and -vector contraction strategies for computing dense tensor decompositions - Oguz Kaya, Laboratoire de Recherche en Informatique 09:25-09:50 (25min)

› Parallel QR factorization of block-tridiagonal matrices from Generative Models - Alfredo Buttari, Institut de recherche en informatique de Toulouse 09:50-10:15 (25min)

› This is yet another talk about scheduling tricks for QR factorization - Julien Langou, Department of Computer Science and Engineering [Denver] 10:15-10:40 (25min)

Break

10:40 - 11:00 (20min)

Break

Hall Leyteire

Job Scheduling

11:00 - 12:40 (1h40)

Job Scheduling

Amphitheatre Leyteire

Kaya Oguz

› Efficient Job Scheduling for Clusters with Shared Tiered Storage - Hamid Mohammadi Fard, Technische Universität Darmstadt 11:00-11:25 (25min)

› Power-aware scheduling for Large-scale Supercomputers - Tapasya Patki, Lawrence Livermore National Laboratory 11:25-11:50 (25min)

› Optimal Vaccination Schedules in Large SIR Systems from a Central and an Agent's Perspective. - Bruno Gaujal, Inria Grenoble Alpes 11:50-12:15 (25min)

› Optimal Online Load Maximization with Commitment - Uwe Schwiegelshohn, TU Dortund University 12:15-12:40 (25min)

Lunch

12:40 - 14:00 (1h20)

Lunch

Hall Leyteire

DAG Scheduling

14:00 - 15:40 (1h40)

DAG Scheduling

Amphitheatre Leyteire

Mathieu Faverge

› An EPTAS for scheduling fork-join task graphs with communication delays - Oliver Sinnen, University of Auckland 14:00-14:25 (25min)

› Scheduling Task Graphs on Bounded Shared-Memory Platforms - Loris Marchal, Laboratoire de lÍnformatique du Parallélisme 14:25-14:50 (25min)

› Task graph execution managed by a runtime: an opportunity for theoreticians - Samuel Thibault, Université de Bordeaux 14:50-15:15 (25min)

› SPAGHETtI: Scheduling/Placement Approach for task-Graphs on HETerogeneous archItecture - Emmanuel Jeannot, Inria Bordeaux - Sud-Ouest 15:15-15:40 (25min)

Coffee break

15:40 - 16:10 (30min)

Coffee break

Hall Leyteire

Discussions

16:10 - 17:50 (1h40)

Discussions

In Amphitheatre Leyteire and nearby rooms