activity
20172025
most citedKokkos Kernels: Performance Portable Sparse/Dense Linear Algebra and Graph Kernels

26 citations · 68 across the 24 of their papers we have counts for

collaborators
Showing cs.DCShow all

14 papers · 1 filter

cs.DC2025

Beyond Exascale: Dataflow Domain Translation on a Cerebras Cluster

Tomas Oppelstrup, Nicholas Giamblanco, Delyan Z. Kalchev +5

Simulation of physical systems is essential across scientific and engineering domains. Commonly used domain decomposition methods are unable to simultaneously deliver both high sim…

cs.DC20247 cited

Breaking the mold: overcoming the time constraints of molecular dynamics on general-purpose hardware

Danny Perez, Aidan Thompson, Stan Moore +11

The evolution of molecular dynamics (MD) simulations has been intimately linked to that of computing hardware. For decades following the creation of MD, simulations have improved w…

cs.DC2023

Jet: Multilevel Graph Partitioning on Graphics Processing Units

Michael S. Gilbert, Kamesh Madduri, Erik G. Boman +1

The multilevel heuristic is the dominant strategy for high-quality sequential and parallel graph partitioning. Partition refinement is a key step of multilevel graph partitioning.…

cs.DC2023

CELLO: Co-designing Schedule and Hybrid Implicit/Explicit Buffer for Complex Tensor Reuse

Raveesh Garg, Michael Pellauer, Sivasankaran Rajamanickam +1

Tensor algebra accelerators have been gaining popularity for running high-performance computing (HPC) workloads. Identifying optimal schedules for individual tensor operations and…

cs.DC2022

PGAbB: A Block-Based Graph Processing Framework for Heterogeneous Platforms

Abdurrahman Yasar, Sivasankaran Rajamanickam, Jonathan W. Berry +1

Designing flexible graph kernels that can run well on various platforms is a crucial research problem due to the frequent usage of graphs for modeling data and recent architectural…

cs.DC2022

Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening

Brian Kelley, Sivasankaran Rajamanickam

Given a graph, finding the distance-2 maximal independent set (MIS-2) of the vertices is a problem that is useful in several contexts such as algebraic multigrid coarsening or mult…