Fused3S: Fast Sparse Attention on Tensor Cores

Sparse attention is a core building block in many leading neural network models, from graph-structured learning to sparse sequence modeling.It can be decomposed into a sequence of three sparse matrix operations (3S): sampled dense-dense matrix multiplication (SDDMM), softmax normalization, and sparse matrix multiplication (SpMM).Efficiently executing the 3S computational pattern on modern GPUs remains challenging due to (a) the mismatch between unstructured sparsity and tensor cores optimized for dense operations, and (b) the high cost of data movement.Previous works have optimized these sparse operations individually or addressed one of these challenges.This paper introduces Fused3S, the first fused 3S algorithm that jointly maximizes tensor core utilization and minimizes data movement.Across real-world graph datasets, Fused3S achieves 1.6 -16.3 and 1.5 -14 speedup over state-of-the-art on H100 and A30 GPUs.Furthermore, integrating Fused3S into Graph Transformer inference accelerates end-to-end performance by 1.05 -5.36, consistently outperforming all 3S baselines across diverse datasets (single and batched graphs) and GPU architectures.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1145/3721145.3730430
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fused3S: Fast Sparse Attention on Tensor Cores

Aparna Chandramowlishwaran, Zitong Li
Parallel Computing and Optimization Techniques
article

Fused3S: Fast Sparse Attention on Tensor Cores

Aparna Chandramowlishwaran, Zitong Li
article en

Abstract

Sparse attention is a core building block in many leading neural network models, from graph-structured learning to sparse sequence modeling.It can be decomposed into a sequence of three sparse matrix operations (3S): sampled dense-dense matrix multiplication (SDDMM), softmax normalization, and sparse matrix multiplication (SpMM).Efficiently executing the 3S computational pattern on modern GPUs remains challenging due to (a) the mismatch between unstructured sparsity and tensor cores optimized for dense operations, and (b) the high cost of data movement.Previous works have optimized these sparse operations individually or addressed one of these challenges.This paper introduces Fused3S, the first fused 3S algorithm that jointly maximizes tensor core utilization and minimizes data movement.Across real-world graph datasets, Fused3S achieves 1.6 -16.3 and 1.5 -14 speedup over state-of-the-art on H100 and A30 GPUs.Furthermore, integrating Fused3S into Graph Transformer inference accelerates end-to-end performance by 1.05 -5.36, consistently outperforming all 3S baselines across diverse datasets (single and batched graphs) and GPU architectures.

University of California, Irvine (US)
University of California, Irvine
Openalex Percentile: Top 77%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Fused3S: Fast Sparse Attention on Tensor Cores — Aparna Chandramowlishwaran, Zitong Li · (2025) | TGRS Research Map | TGRS