ParGraph 2012 - Workshop on Parallel Algorithms and Software for Analysis of Massive Graphs (ParGraph)

Combinatorial algorithms play an important enabling role in several areas of science and engineering. Many combinatorial algorithms, graph algorithms in particular, are characterized by irregular data-access patterns that make efficient implementation on traditional high-performance computing platforms challenging. Architectural features, algorithmic design and software engineering techniques, and characteristics of the input collectively determine the performance of these algorithms.
In addition, runtime support for irregular applications, programming models (e.g., partitioned global address space (PGAS), bulk-synchronous processing (BSP), active messages), and the emergence of hybrid manycore platforms deserve attention. With this workshop we aim to bring together diverse researchers interested in combinatorial (graph) algorithms, data intensive applications involving them, and parallel computing.
We seek submissions on broad topics of interest as listed below, but not limited to this:
Theory and Algorithms:
Combinatorial (graph) algorithms and libraries
Algorithms for analysis of large complex networks (social network analysis)
Approximation algorithms and bounds
Design and performance evaluation of algorithms on:
Traditional architectures: massively parallel distributed-memory systems (IBM BlueGene, Cray XE), shared-memory multicore systems (Intel, AMD)
Nontraditional architectures: massively multithreaded architectures (Cray XMT), manycore and tiled platforms (Nvidia, AMD, Tilera)
Applications:
Combinatorial Scientific Computing; Data Mining; Graph Mining; Machine Learning
Bioinformatics; Information (Cyber) security; Mobile computing
Visual Analytics; Graph Visualization
Programming paradigms and runtime support for irregular applications