CALL FOR PAPERS
(Extended full paper deadline: January 29, 2015)
Graph Algorithm Building Blocks (GABB) 2015
An IPDPS 2015 Workshop, May 25, 2015, Hyderabad, India
=== 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.
=== Submission and Dates ===
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.
*- Due dates: *
*full papers due 29 Jan 2015,*
*author notification 14 Feb 2015, *
*camera-ready due 28 Feb 2015.*
- Workshop web page: http://www.graphanalysis.org/workshop2015.html
=== Presentation at the workshop ===
It is expected that each accepted submission will be presented at the
workshop, which will be held (one day) in conjunction with IPDPS 2015, May
25, 2015, in Hyderabad, India.
=== 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
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
