Graph Algorithms | Siva Rajamanickam

TenSQL: An SQL Database Built on GraphBLAS

Jon Roose, Miheer Vaidya, Ponnuswamy Sadayappan, Sivasankaran Rajamanickam

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 (CSC) has served as the foundation of several scientific simulations for the past three decades. Several of the problems in the field 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 Çatalyü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 Çatalyü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 Çatalyürek

Distributed graph layout for scalable small-world network analysis