[hpc-announce] Extended Deadline: The First International Workshop on High Performance Graph Processing (HPGP'16) 

Toyotaro Suzumura tsuzumura at us.ibm.com
Mon Jan 25 11:20:26 CST 2016

Call for Papers: The First International Workshop on High Performance Graph
Processing (HPGP'16)
Co-located with 25th ACM International Symposium on High-Performance
Parallel and Distributed Computing (HPDC), Kyoto, Japan

Workshop website: http://hpgp.bsc.es/
Deadline is extended to 20th Feb, 2016

Call for Papers

Applications which need to manage and process large scale graph data have
become prominent in recent times. Semantic web, bioinformatics,
cheminformatics, etc. are some examples for such application domains which
deal with large graphs of millions and billions of vertices. Graphs due to
their linked nature pose significant challenges for storage and processing.
Graph processing have attracted significant attention from High Performance
Computing (HPC) community due to this reason. Significant body of research
have been conducted in recent times to address the void of large graph data
analysis. New programming models such as Pregel, graph processing
frameworks such as Giraph, Hama, and libraries such as GraphLab, PBGL,
ScaleGraph have been developed to address the need of software for high
performance large graph processing. Furthermore, large scale distributed
memory compute clusters, single shared memory high performance computers,
heterogeneous hardware such as GPGPUs, FPGAs have been tested for carrying
out large graph data processing tasks. These efforts have been bolstered by
graph related benchmarking initiatives such as Graph 500, Green Graph 500,
etc. Despite these significant research efforts, there exist significant
issues and technical gaps which need to be solved in the area of high
performance graph data mining.

High Performance Graph Processing 2016 (HPGP’16) workshop aims to provide a
unified platform for discussing the latest state-of-the-art efforts
conducted to address such research issues related to high performance large
graph processing. HPGP’16 will be held in conjunction with the ACM
International Symposium on High-Performance Parallel and Distributed
Computing (HPDC) 2016 as a half-day workshop. The workshop will take place
in the beautiful, ancient city of Kyoto at Kyoto International Community
House. We invite researchers from academia and industry working in graph
data mining and management in high performance computing environments to
submit their original (full/short) papers. Submissions will be peer
reviewed in single-blinded manner and each submission will receive minimum
two reviewer comments. The main topics of the workshop include, but not
limited to:

* Novel large graph processing frameworks and programming paradigms
* Graph processing in many core processors such as GPGPUs/FPGAs, Xeon Phi,
* Graph processing in Clouds
* 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

Submission Guidelines

A submitted paper should be of one of the following type:

1. Regular Research Paper: The paper will report original research results
with sound evaluation. It should be at most 8 pages.

2. Short Paper: The paper will present a survey or an on-going work. It
will clearly state the problem to be addressed and an outline of the
methodology that the authors plan to follow. It should be at most 4 pages.

All submissions must be prepared in the ACM Proceedings Style (
http://www.acm.org/sigs/publications/proceedings-templates). The papers
must be formatted as single-blinded. All accepted submissions will be
published in the ACM digital library.

Important Dates

Paper submission deadline: 20th Feb 2016
Decision notification: 12th March 2016
Camera-ready deadline: 27th March 2016
Workshop date: 31st May 2016

Workshop Organizers:
General Chairs:
Toyotaro Suzumura (IBM T.J.Watson Research Center, USA)
Dario Garcia-Gasulla (BSC-CNS)

Program Committee Chair:
Miyuru Dayarathna (WSO2, Inc., USA)

Program Committee:
Mehmet Balman (LBL/VMware Inc., USA)
Maciej Besta (ETH Zürich, Switzerland)
Aydın Buluç (LBL, USA)
Sameh Elnikety (Microsoft Research, USA)
Stephan Günnemann (Technical University of Munich, Germany)
Mahantesh Halappanavar (PNNL, USA)
Alexandru Iosup (Delft University of Technology, The Netherlands)
George Karypis (University of Minnesota, USA)
Andrew Lenharth (University of Texas at Austin, USA)
Andrew Lumsdaine (Indiana University, USA)
Naoya Maruyama (Riken, Japan)
Suzanne McIntosh (Cloudera, New York University, USA)
René Peinl (Hof University, Germany)
Ali Pinar (Sandia National Laboratories, USA)
Jason Riedy (Georgia Institute of Technology, USA)
Matei Ripeanu (The University of British Columbia, Canada)
Amitabha Roy (Intel Labs, USA)
Sherif Sakr (University of New South Wales, Australia)
Julian Shun (University of California, Berkeley, USA)
Hanghang Tong (Arizona State University, USA)
Anthony Ventresque (University College Dublin, Ireland)
Peter Wood (University of London, UK)
Yinglong Xia (IBM T.J. Watson Research Center, USA)
Li Xutao (Harbin Institute of Technology, China)
Xifeng Yan (University of California, Santa Barbara, USA)

Submission Instructions
Only electronic submissions in PDF format will be considered. Please upload
your paper through the EasyChair submission site (

Contact Information
In case of questions, please contact Workshop General Chair Toyotaro
Suzumura (tsuzumura at us.ibm.com).

Toyotaro Suzumura, Ph.D.
Research Staff Member, IBM T.J. Watson Research Center
1101 Kitchawan Rd, Route 134 / PO BOX 218
Yorktown Heights, New York, US 10598. Office: 21-151, Tel: +1-914-945-1805
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://lists.mcs.anl.gov/mailman/private/hpc-announce/attachments/20160125/22f5007c/attachment.html>

More information about the hpc-announce mailing list