Graph Algorithms Building Blocks (GABB’2015)
Hyderabad International Convention Center
Hyderabad, India
25 May 2015
Scope and Goals:
The Basic Linear Algebra Subprograms, introduced over 30 years ago, had a transformative effect on software for linear algebra. With the BLAS, researchers spend less time mapping algorithms onto specific features of hardware platforms and more time on interesting new algorithms.
Would it be practical to define an analogous set of basic building blocks for graph algorithms? Can we define a core set of mathematical primitives from which we can build most (if not all) important graph algorithms? If we can agree on the mathematical foundations, how would these interact with the data structures used in graph algorithms and result in an API the graph algorithms research community could support?
These questions will be the topic for the second “Graph Algorithms Building Blocks” workshop. Our goal is an interactive workshop where the full range of issues behind “Graph Algorithms Building Blocks” will be explored. We want an interactive “workshop” so papers that report preliminary results and unproven but interesting ideas will be considered.
Location:
This workshop is co-located with IPDPS 2015, held 25 - 29 May 2015, at the Hyderabad International Convention Center, in
Hyderabad, India. Registration information for IPDPS2015 can be found at here.
Details and Dates
To submit a paper, upload a PDF copy here. Submitted manuscripts may not exceed ten (10) single-spaced double-column pages using 10-point size font on 8.5x11 inch pages (IEEE conference style), including figures, tables, and references (see IPDPS Call for Papers for more details). Papers shorter than 10 pages are welcome and even encouraged. All papers will be reviewed. IEEE CS Press will publish the IPDPS symposium and workshop abstracts as a printed volume. The complete symposium and workshop proceedings will also be published by IEEE CS Press on CD-ROM and will also be available in the IEEE Digital Library.
- Submissions due: January 30, 2015, by midnight EST (EXTENDED DEADLINE)
- Notification: February 14, 2015
- Final Manuscript due: February 28, 2015
GABB Preliminary Agenda
| Time | Speaker | Topic |
| 08:00 | Tim Mattson, Intel | Welcome |
| 08:05 | Yogish Sabharwal | Keynote Talk: Bracing for the Sprint and the Marathon |
| 09:00 - 09:30 | Marcin Zalewski, Nicholas Edmonds, Andrew Lumsdaine | Declarative Patterns for Imperative Distributed Graph Algorithms https://doi.org/10.1109/IPDPSW.2015.78 |
| 09:30 - 10:00 | Ariful Azad, Aydin Buluc, John Gilbert | Parallel Triangle Counting and Enumeration using Matrix Algebra https://doi.org/10.1109/IPDPSW.2015.75 |
| 10:00 - 10:30 | Break | |
| 10:30 - 11:00 | Anil Hirani, Kaushik Kalyanaraman, Seth Watts | Graph Laplacians and Least Squares on Graphs https://doi.org/10.1109/IPDPSW.2015.73 |
| 11:00 - 11:30 | Vijay Gadepally, Jake Bolewski, Daniel Hook, Dylan Hutchison, Benjamin A Miller, Jeremy Kepner | Graphulo: Linear Algebra Graph Kernels for NoSQL Databases https://doi.org/10.1109/IPDPSW.2015.19 |
| 11:30 - 12:00 | Jeremiah Willcock, Andrew Lumsdaine | A Unifying Programming Model for Parallel Graph Algorithms https://doi.org/10.1109/IPDPSW.2015.79 |
| 12:00 - 12:30 | Carl Yang, Yangzihao Wang, John Owens | Fast Sparse Matrix and Sparse Vector Multiplication Algorithm on the GPU https://doi.org/10.1109/IPDPSW.2015.77 |
Workshop Organizers:
Program committee:
- Tim Mattson, Intel Corp. (Chair)
- David A. Bader, Georgia Institute of Technology
- Jonathan Berry, Sandia National Labs
- Aydın Buluç, Lawrence Berkeley National Lab
- John Gilbert, UC Santa Barbara
- Jeremy Kepner, MIT Lincoln Labs
- Chris Long, US Department of Defense
- Kamesh Madduri, Penn State University
- Henning Meyerhenke, Karlsruhe Institute of Technology
- Fabrizio Petrini, IBM
Steering committee:
- David A. Bader (Georgia Institute of Technology)
- Aydın Buluç (LBNL)
- John Gilbert (UC Santa Barbara)
- Jeremy Kepner (MIT Lincoln Labs)