Program

The program takes place at Albuquerque Marriott
(2101 Louisiana Boulevard NE; Albuquerque NM 87110)

HTML Table
Sunday, October 9
6:30 - 8:30 Welcome Reception
Location: Zuni Terrace - Poolside
Monday, October 10
Graphs and Applications; Algorithmic Differentiation; Optimization
Location for all sessions in the day: Pecos/Sandia
Session Chair: Assefaw Gebremedhin
8:30 - 8:40 Opening Remarks
8:40 - 9:25

Invited Talk: Parallel Machine Learning Approaches for Reverse Engineering Genome-scale Networks
Srinivas Aluru, Georgia Institute of Technology, USA
Slides

9:35 - 9:55

Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics
Hristo N. Djidjev, Los Alamos National Laboratory, USA
Slides

10:00 - 10:20

An Adaptive Parallel Algorithm for Computing Connectivity
Chirag Jain, Georgia Institute of Technology, USA
Slides

10:30 - 11:00 Coffee Break
Session Chair: Sherry Li
11:00 - 11:20

On Stable Marriages and Greedy Matchings
Fredrik Manne, University of Bergen, Norway
Slides

11:25 - 11:45

A New 3/2-Approximation Algorithm for the b-Edge Cover Problem
Arif Khan, Purdue University, USA
Slides

11:50 - 12:10

Fast Hierarchy Construction for Dense Subgraphs
A. Erdem Sariyuce, Sandia National Laboratories, USA
Slides

12:15 - 1:45 Lunch Break
Session Chair: Stefan Wild
1:45 - 2:05

Edge Pushing is Equivalent to Vertex Elimination for Computing Hessians
Mu Wang, Purdue University, USA
Slides

2:10 - 2:30

An Integer Programming Formulation of the Minimal Jacobian Representation Problem
Paul Hovland, Argonne National Laboratory, USA
Slides

2:35 - 2:55

Mixed Integer Programming for Call Tree Reversal
Uwe Naumann, RWTH Aachen University, Germany
Slides

3:00 - 3:30 Coffee Break
Session Chair: Ilya Safro
3:30 - 3:50

Extending the Binomial Checkpointing Technique for Resilience
Krishna Narayanan, Argonne National Laboratory, USA
Slides

3:55 - 4:15

Coordinated Platoon Routing in a Metropolitan Network
Jeffrey Larson, Argonne National Laboratory, USA
Slides

4:20 - 4:40

Using Tropical Optimization Techniques to Evaluate Alternatives via Pairwise Comparisons
Nikolai Krivulin, St. Petersburg State University, Russia
Slides

4:45 - 6:30 Free
6:30 -

Workshop Dinner
Monica's El Portal Restaurant
321 Rio Grande Blvd NW
Albuquerque, NM 87104
(505) 247-9625

At the dinner, we will also celebrate the 60th birthdays of
Rob Bisseling and Alex Pothen.

Tuesday, October 11
Graphs and Sparse Computations
Location for all sessions in the day: Pecos/Sandia
Session Chair: Erik Boman
8:30 - 8:40 Remarks/Announcements
8:40 - 9:25

Invited Talk: Graphs and sparse Matrices: There and Back Again
John Gilbert, University of California, Santa Barbara, USA
Slides

9:35 - 9:55

A Hybrid Mutithreaded Direct Sparse Triangular Solver
Andrew Bradley, Sandia National Laboratories, USA
Slides

10:00 - 10:20

HiLUK: Scalable Incomplete Factorization Utilizing Combinatorial Methods to Reduce Overheads
Siva Rajamanickam, Sandia National Laboratories, USA
Slides

10:30 - 11:00 Coffee Break
Session Chair: Rob Bisseling
11:00 - 11:20

Preconditioning Techniques Based on the Birkhoff-von Neumann Decomposition
Bora Ucar, CNRS and LIP ENS Lyon, France
Slides

11:25 - 11:45

Enabling Implicit Time Integration for Compressible Flows by Partial Coloring: A Case Study of a Semi-matrix-free Preconditioning Technique
Martin Buecker, University of Jena, Germany
Slides

11:50 - 12:10

Sparse Computations and Multi-BSP
Albert-Jan Yzelman, Huawei Technologies France, France
Slides

12:15 - 1:45 Lunch Break
Session Chair: Cevdet Aykanat
1:45 - 2:05

HPCGraph: Benchmarking Massive Graph Analytics on Supercomputers
George Slota, Penn State University, USA
Slides

2:10 - 2:30

Convex Partitioning of Large-Scale Directed Graphs
Umit Catalyurek, Georgia Institute of Technology, USA
Slides

2:35 - 2:55

Highly Scalable Community Detection using a GPU
Md. Naim, University of Bergen, Norway
Slides

3:00 - 3:30 Coffee Break
Session Chair: Bora Ucar
3:30 - 3:50

Sparse Matrix-Matrix Multiplication for Modern Architectures
Mehmet Deveci, Sandia National Laboratories, USA
Slides

3:55 - 4:15

Exploiting Matrix Reuse and Data Locality in Sparse Matrix-Vector and Matrix-Transpose-Vector Multiplication on Many-Core Architectures
Kadir Akbudak, KAUST, Extreme Computing Research Center, Saudi Arabia
Slides

4:20 - 4:30 Short Break
4:30 - 6:00 Business Meeting, Chair: Alex Pothen
Location: Pecos/Sandia
6:00 - 7:00 Poster Session
Location: Pecos/Sandia
Wednesday, October 12
Spectral Graph Theoretic Approaches; Ordering; Partitioning
Location for all sessions in the day: Pecos/Sandia
Session Chair: Bruce Hendrickson
8:30 - 8:40 Remarks/Announcements
8:40 - 9:25

Invited Talk: The Revolution in Graph Theoretic Optimization
Gary Miller, Carnegie Mellon University, USA
Slides

9:35 - 9:55

Estimating Current-flow Closeness Centrality with a Multigrid Laplacian Solver
Elisabetta Bergamini, Karlsruhe Institute of Technology, Germany
Slides

10:00 - 10:20

An Empirical Study of Cycle Toggling based Laplacian Solver
Kevin Deweese, University of California, Santa Barbara, USA
Slides

10:30 - 11:00 Coffee Break
Session Chair: Sivan Toledo
11:00 - 11:20

A Parallel Solver for Laplacian Matrices
Tristan Konolige, University of Colorado Boulder, USA
Slides

11:25 - 11:45

Hierarchical Probing for General Graphs, a Method for Computing Diag(f(A))
Jesse Laeuchli, Department of Defense, USA
Slides

11:50 - 12:10

Augmenting Hypergraph Models with Message Nets to Reduce Bandwidth Latency Costs
Seher Acer, Bilkent University, Turkey
Slides

12:15 - 1:45 Lunch Break
Session Chair: Siva Rajamanickam
1:45 - 2:05

A Global, Distributed Ordering Library
Francois-Henry Rouet, Livermore Software Technology Corporation, USA
Slides

2:10 - 2:30

The Reverse Cuthill-McKee Algorithm in Distributed-Memory
Ariful Azad, Lawrence Berkeley National Laboratory, USA
Slides

2:35 - 2:55

A Multilevel Vertex Separator Algorithm Based on the Solution of Bilinear Programs
James Hungerford, M.A.I.O.R., Srl, Italy
Slides

3:00 - 3:20 Balance-Enforced Multi-Level Algorithm for Multi-Criteria Mesh Partitioning
Remi Barat, CEA - Université de Bordeaux, France
Slides