Graph Algorithms

Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening
Brian Kelley, Sivasankaran Rajamanickam
Parallel graph coloring algorithms for distributed GPU environments
Ian Bogle, George M Slota, Erik G Boman, Karen Devine, Sivasankaran Rajamanickam
Combinatorial Scientific Computing
Combinatorial scientific computing (CSC) has served as the foundation of several scientific simulations for the past three decades. Several of the problems in the field of deal with an interesting mix of combinatorial, numerical, and computer architecture issues.
A Block-Based Triangle Counting Algorithm on Heterogeneous Environments
Abdurrahman Yaşar, Sivasankaran Rajamanickam, Jonathan W Berry, Ümit V Catalyürek
EXAGRAPH: Graph and combinatorial methods for enabling exascale applications
Seher Acer, Ariful Azad, Erik G Boman, Aydın Buluç, Karen D Devine, SM Ferdous, Nitin Gawande, Sayan Ghosh, Mahantesh Halappanavar, Ananth Kalyanaraman, others
Kokkos Kernels: Performance Portable Sparse/Dense Linear Algebra and Graph Kernels
Sivasankaran Rajamanickam, Seher Acer, Luc Berger-Vergiat, Vinh Dang, Nathan Ellingwood, Evan Harvey, Brian Kelley, Christian R Trott, Jeremiah Wilke, Ichitaro Yamazaki
Performance-portable graph coarsening for efficient multilevel graph analysis
Michael S Gilbert, Seher Acer, Erik G Boman, Kamesh Madduri, Sivasankaran Rajamanickam
Sphynx: A parallel multi-GPU graph partitioner for distributed-memory systems
Seher Acer, Erik G Boman, Christian A Glusa, Sivasankaran Rajamanickam
Distributed Memory Graph Coloring Algorithms for Multiple GPUs
Ian Bogle, Erik G Boman, Karen Devine, Sivasankaran Rajamanickam, George M Slota
Scalable, multi-constraint, complex-objective graph partitioning
George M Slota, Cameron Root, Karen Devine, Kamesh Madduri, Sivasankaran Rajamanickam
SPHYNX: Spectral Partitioning for HYbrid aNd aXelerator-enabled systems
Seher Acer, Erik G Boman, Sivasankaran Rajamanickam
A Parallel Graph Algorithm for Detecting Mesh Singularities in Distributed Memory Ice Sheet Simulations
Ian Bogle, Karen Devine, Mauro Perego, Sivasankaran Rajamanickam, George M Slota
Linear algebra-based triangle counting via fine-grained tasking on heterogeneous environments:(Update on static graph challenge)
Abdurrahman Yaşar, Sivasankaran Rajamanickam, Jonathan Berry, Michael Wolf, Jeffrey S Young, Ümit V Catalyürek
Scalable generation of graphs for benchmarking HPC community-detection algorithms
George M Slota, Jonathan W Berry, Simon D Hammond, Stephen L Olivier, Cynthia A Phillips, Sivasankaran Rajamanickam
Scalable triangle counting on distributed-memory systems
Seher Acer, Abdurrahman Yaşar, Sivasankaran Rajamanickam, Michael Wolf, Ümit V Catalyürek
Experimental design of work chunking for graph algorithms on high bandwidth memory architectures
George M Slota, Siva Rajamanickam
Fast triangle counting using cilk
Abdurrahman Yaşar, Sivasankaran Rajamanickam, Michael Wolf, Jonathan Berry, Ümit V Catalyürek
Distributed graph layout for scalable small-world network analysis
George M Slota, Sivasankaran Rajamanickam, Kamesh Madduri
Fast linear algebra-based triangle counting with kokkoskernels
Michael M Wolf, Mehmet Deveci, Jonathan W Berry, Simon D Hammond, Sivasankaran Rajamanickam
Order or shuffle: Empirically evaluating vertex order impact on parallel graph computations
George M Slota, Sivasankaran Rajamanickam, Kamesh Madduri
Partitioning trillion-edge graphs in minutes
George M Slota, Sivasankaran Rajamanickam, Karen Devine, Kamesh Madduri
A case study of complex graph analysis in distributed memory: Implementation and optimization
George M Slota, Sivasankaran Rajamanickam, Kamesh Madduri
Complex network partitioning using label propagation
George M Slota, Kamesh Madduri, Sivasankaran Rajamanickam
Parallel graph coloring for manycore architectures
Mehmet Deveci, Erik G Boman, Karen D Devine, Sivasankaran Rajamanickam
High-performance graph analytics on manycore processors
George M Slota, Sivasankaran Rajamanickam, Kamesh Madduri
BFS and coloring-based parallel algorithms for strongly connected components and related problems
George M Slota, Sivasankaran Rajamanickam, Kamesh Madduri
PuLP: Scalable multi-objective multi-constraint partitioning for small-world networks
George M Slota, Kamesh Madduri, Sivasankaran Rajamanickam
Scalable matrix computations on large scale-free graphs using 2D graph partitioning
Erik G Boman, Karen D Devine, Sivasankaran Rajamanickam
Multithreaded Algorithms for Maximum Matching in Bipartite Graphs
Ariful Azad, Mahantesh Halappanavar, Sivasankaran Rajamanickam, Erik G Boman, Arif Khan, Alex Pothen
Parallel partitioning with zoltan: Is hypergraph partitioning worth it?
Sivasankaran Rajamanickam, Erik G Boman
An Evaluation of the Zoltan Parallel Graph and Hypergraph Partitioners.
Sivasankaran Rajamanickam, Erik G Boman