Graph Algorithms Building Blocks (GABB’2016)
Chicago Hyatt Regency
Chicago, Illinois, USA
23 May 2016
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 third “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 2016, held 23 - 27 May 2016, at the Chicago Hyatt Regency, in Chicago, Illinois, USA. Registration information for IPDPS2016 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. Proceedings of the workshops are distributed at the conference and
are submitted for inclusion in the IEEE Xplore Digital Library after
the conference.
- Submissions due: January 29, 2016 EST (updated)
- Notification: February 12, 2016
- Final Manuscript due: February 26, 2016
GABB Preliminary Agenda
Time | Speaker | Topic |
8:20am - 8:30am | Tim Mattson, Intel | Welcome |
8:30am - 9am | Mark Tullsen; Matthew Sottile | Array Types for a Graph Processing Language |
9am - 9:30am | Jiahao Chen; Weijian Zhang | The Right Way to Search Evolving Graphs |
9:30am - 10am | Jason Riedy | Updating PageRank for Streaming Graphs |
10am - 10:30am | Morning Break | |
10:30am - 11am | Sriram Srinivasan; Sanjukta Bhowmick; Sajal K. Das | Application of Graph Sparsification in Developing Parallel Algorithms for Updating Dynamic Networks |
11am - 11:30am | Keita Iwabuchi; Scott Sallinen; Roger Pearce; Brian Van Essen; Maya Gokhale; Satoshi Matsuoka | Towards a Distributed Large-Scale Dynamic Graph Data Store |
11:30am - 12pm | Brendan Gavin; Vijay Gadepally; Jeremy Kepner | Enforced Sparse Non-Negative Matrix Factorization |
12pm - 1:30pm | Lunch | |
1:30pm - 2:30pm | David A. Bader | Keynote talk: Massive-scale streaming analytics |
2:30pm-3pm | Peter Zhang; Samantha Misurda; Marcin Zalewski; Scott McMillan; A. Lumsdaine | GBTL-CUDA: Graph Algorithms and Primitives for GPUs |
3pm - 3:30pm | Afternoon Break | |
3:30pm - 4pm | Peter Kogge | Jaccard Coefficients as a Potential Graph Benchmark |
4pm - 4:30pm | Patrick Dreher; Chansup Byun; Chris Hill; Vijay Gadepally; Bradley Kuszmaul; Jeremy Kepner | PageRank Pipeline Benchmark: Proposal for a Holistic System Benchmark for Big-Data Platforms |
4:30pm - 5pm | Fabrizio Petrini; Kamesh Madduri; John Gilbert; Scott McMillan | Panel |
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
- Andrew Lumsdaine, Indiana University
- Kamesh Madduri, Penn State University
- Henning Meyerhenke, Karlsruhe Institute of Technology
- John Owens, University of California, Davis
- Fabrizio Petrini, IBM
- Sivan Toledo, Tel Aviv University
Steering committee:
- David A. Bader (Georgia Institute of Technology)
- Aydın Buluç (LBNL)
- John Gilbert (UC Santa Barbara)
- Jeremy Kepner (MIT Lincoln Labs)