CSC

Interface for sparse linear algebra operations
Ahmad Abdelfattah Et Al.
Jet: Multilevel graph partitioning on graphics processing units
Michael Gilbert, Kamesh Madduri, Erik G. Boman, Sivasankaran 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
FROSch Preconditioners for Land Ice Simulations of Greenland and Antarctica
Alexander Heinlein, Mauro Perego, 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 deal with an interesting mix of combinatorial, numerical, and computer architecture issues.
Kokkos Kernels

See Kokkos Kernels Website for more details.

Jan 8, 2022
Trilinos

Trilinos is large framework that serves as the foundation for several computational science applications. It provides capabilities for building portable, high performance, parallel science codes. The basic functionality provided include distributed linear algebra, portable sparse/dense linear algebra kernels, load balancing utilites, sparse linear solvers, non-linear solvers, discretization and meshing utilities.
Jan 8, 2022
Mixed Precision in Trilinos
Nov 30, 2021 11:00 AM — 11:30 AM Online
Enabling Science Simulations with Scalable Computational Frameworks for Scientific Computing
Oct 19, 2021 10:00 AM — 11:00 AM Google X.
Mixed-Precision Schemes for Linear Algebra Kernels on GPUs
Mar 3, 2021 11:00 AM — 11:30 AM Online
A Block-Based Triangle Counting Algorithm on Heterogeneous Environments
Abdurrahman Yaşar, Sivasankaran Rajamanickam, Jonathan W Berry, Ümit v Çatalyürek
A survey of numerical methods utilizing mixed precision arithmetic
Ahmad Abdelfattah, Hartwig Anzt, Erik G Boman, Erin Carson, Terry Cojean, Jack Dongarra, Alyson Fox, Mark Gates, Nicholas J Higham, Xiaoye Li, Others
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
FROSch Preconditioners for Land Ice Simulations of Greenland and Antarctica
Alexander Heinlein, Mauro Perego, Sivasankaran Rajamanickam
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
A survey of numerical methods utilizing mixed precision arithmetic
Ahmad Abdelfattah, Hartwig Anzt, Erik G Boman, Erin Carson, Terry Cojean, Jack Dongarra, Mark Gates, Thomas Grützmacher, Nicholas J Higham, Sherry Li, Others
ADELUS: A Performance-Portable Dense LU Solver for Distributed-Memory Hardware-Accelerated Systems.
Vinh Q Dang, Joseph D Kotulski, Sivasankaran Rajamanickam
An algebraic sparsified nested dissection algorithm using low-rank approximations
Léopold Cambier, Chao Chen, Erik G Boman, Sivasankaran Rajamanickam, Raymond S Tuminaro, Eric Darve
Distributed Memory Graph Coloring Algorithms for Multiple GPUs
Ian Bogle, Erik G Boman, Karen Devine, Sivasankaran Rajamanickam, George M Slota
Performance portable supernode-based sparse triangular solver for manycore architectures
Ichitaro Yamazaki, Sivasankaran Rajamanickam, Nathan Ellingwood
Preparing sparse solvers for exascale computing
Hartwig Anzt, Erik Boman, Rob Falgout, Pieter Ghysels, Michael Heroux, Xiaoye Li, Lois Curfman McInnes, Richard Tran Mills, Sivasankaran Rajamanickam, Karl Rupp, Others
Scalable asynchronous domain decomposition solvers
Christian Glusa, Erik G Boman, Edmond Chow, Sivasankaran Rajamanickam, Daniel B Szyld
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
A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling
Chao Chen, Leopold Cambier, Erik G Boman, Sivasankaran Rajamanickam, Raymond S Tuminaro, Eric Darve
Geometric Mapping of Tasks to Processors on Parallel Computers with Mesh or Torus Networks
Mehmet Deveci, Karen D Devine, Kevin Pedretti, Mark a Taylor, Sivasankaran Rajamanickam, Ümit v Çatalyürek
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
A distributed-memory hierarchical solver for general sparse linear systems
Chao Chen, Hadi Pouransari, Sivasankaran Rajamanickam, Erik G Boman, Eric Darve
Asynchronous one-level and two-level domain decomposition solvers
Christian Glusa, Erik G Boman, Edmond Chow, Sivasankaran Rajamanickam, Paritosh Ramanan
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
FROSch: a fast and robust overlapping Schwarz domain decomposition preconditioner based on Xpetra in Trilinos
Alexander Heinlein, Axel Klawonn, Sivasankaran Rajamanickam, Oliver Rheinbach
Geometric partitioning and ordering strategies for task mapping on parallel computers
Mehmet Deveci, Karen D Devine, Kevin Pedretti, Mark a Taylor, Sivasankaran Rajamanickam, Umit v Catalyurek
Multithreaded sparse matrix-matrix multiplication for many-core and GPU architectures
Mehmet Deveci, Christian Trott, Sivasankaran Rajamanickam
Tacho: memory-scalable task parallel sparse Cholesky factorization
Kyungjoo Kim, H Carter Edwards, Sivasankaran Rajamanickam
Basker: Parallel sparse LU factorization utilizing hierarchical parallelism and data layouts
Joshua D Booth, Nathan D Ellingwood, Heidi K Thornquist, Sivasankaran Rajamanickam
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
Performance-portable sparse matrix-matrix multiplication for many-core architectures
Mehmet Deveci, Christian Trott, Sivasankaran Rajamanickam
A case study of complex graph analysis in distributed memory: Implementation and optimization
George M Slota, Sivasankaran Rajamanickam, Kamesh Madduri
A survey of direct methods for sparse linear systems
Timothy a Davis, Sivasankaran Rajamanickam, Wissam M Sid-Lakhdar