2 citations · 2 across the 6 of their papers we have counts for
4 papers · 1 filter
Graph Traversal on Tensor Cores: A BFS Framework for Modern GPUs
Deniz Elbek, Kamer Kaya
Modern GPUs have Tensor Cores (TCs) capable of extremely high-throughput matrix operations, yet graph algorithms remain difficult to accelerate because of their irregular and data-…
BLEST: Blazingly Efficient BFS using Tensor Cores
Deniz Elbek, Kamer Kaya
Breadth-First Search (BFS) is a fundamental graph kernel that underpins a wide range of applications. While modern GPUs provide specialised Matrix-Multiply-Accumulate (MMA) units,…
SUperman: Efficient Permanent Computation on GPUs
Deniz Elbek, Fatih Taşyaran, Bora Uçar +1
The permanent is a function, defined for a square matrix, with applications in various domains including quantum computing, statistical physics, complexity theory, combinatorics, a…
Fully-Automated Code Generation for Efficient Computation of Sparse Matrix Permanents on GPUs
Deniz Elbek, Kamer Kaya
Registers are the fastest memory components within the GPU's complex memory hierarchy, accessed by names rather than addresses. They are managed entirely by the compiler through a…