High Performance Graph Data Management and Processing workshop
November 13th, 2016 | Salt Lake City, USA.
SuperComputing'16 SuperComputing'16 BSC

Call for papers

  • The submission deadline is on August 8th 2016, 11:59 PM Anywhere on Earth (AoE) Time
  • Papers must be submitted in PDF format via HPGDMP'16 submission page https://easychair.org/conferences/?conf=hpgdmp2016
  • All papers will be peer reviewed
  • Author names and affiliations should appear in the submissions
  • Notification deadline is on September 28th 2016
  • For accepted papers, at least one author must attend the workshop to present the work.

Topics of Interest

The topics of interest of the HPGDMP'16 include multiple aspects of graph data management and processing on high performance systems, but not limited to:

  • Novel large graph data management systems
  • Novel large graph processing frameworks and programming paradigms
  • Graph processing in manycore processors such as GPUs, Xeon Phi, etc.
  • Graph data management and processing in the cloud
  • HPC graph databases and query languages
  • Novel graph partitioning algorithms
  • Application experiences of large graph processing on HPC environments
  • Benchmarks for large graph processing workloads
  • Performance characterization of large graph mining tasks
  • Scalable graph analysis algorithms and novel data structures
  • High performance streaming graph processing algorithms

Type of Papers

HPGDMP'16 will host two types of papers:

  • Full research papers (8 Pages)
  • Short papers (4 Pages)

Authors should indicate in their abstracts the kind of submission that the paper belongs to, to help reviewers better understand their contributions.

Submission Format

Submissions must be made in PDF formatted according to ACM conference proceedings template.
Submissions must be up to 8 pages full papers or 4 page short papers — including references, diagrams, and appendices, if any.

Publication

The proceedings of the HPGDMP16 will be published in cooperation with ACM SIGHPC and will be available in both the ACM Digital Library and the IEEE Xplore Digital Library.