Cover Image

BLEST: Blazingly Efficient BFS using Tensor Cores

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Elbek, Deniz, Kaya, Kamer
Format:	Preprint
Published:	2025
Subjects:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Parallel Cluster-BFS and Applications to Shortest Paths
by: Wang, Letong, et al.
Published: (2024)

Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
by: Sahu, Abhijeet, et al.
Published: (2026)

A Parallel Scan Algorithm in the Tensor Core Unit Model
by: Zouzias, Anastasios, et al.
Published: (2024)

Fully-Automated Code Generation for Efficient Computation of Sparse Matrix Permanents on GPUs
by: Elbek, Deniz, et al.
Published: (2025)

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
by: Yang, Mingqi
Published: (2024)

Parallel $k$-Core Decomposition: Theory and Practice
by: Liu, Youzhe, et al.
Published: (2025)

Exploiting Multi-Core Parallelism in Blockchain Validation and Construction
by: Karmegam, Arivarasan, et al.
Published: (2026)

Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
by: Liu, Quanquan C., et al.
Published: (2024)

Round and Communication Efficient Graph Coloring
by: Chang, Yi-Jun, et al.
Published: (2024)

Efficient Dynamic MaxFlow Computation on GPUs
by: Kannappan, Shruthi, et al.
Published: (2025)

Time-Optimal and Energy-Efficient Deterministic Consensus
by: Meir, Shachar, et al.
Published: (2025)

Efficient Enumeration of Large Maximal k-Plexes
by: Cheng, Qihao, et al.
Published: (2024)

Parallel Contraction Hierarchies Can Be Efficient and Scalable
by: Wan, Zijin, et al.
Published: (2024)

Parallel and (Nearly) Work-Efficient Dynamic Programming
by: Ding, Xiangyun, et al.
Published: (2024)

Energy-Efficient Maximal Independent Sets in Radio Networks
by: Banasik, Dominick, et al.
Published: (2025)

Two Efficient Message-passing Exclusive Scan Algorithms
by: Träff, Jesper Larsson
Published: (2026)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
by: Wang, Letong, et al.
Published: (2023)

TC-MIS: Maximal Independent Set on Tensor-cores
by: Nijhara, Prajjwal, et al.
Published: (2026)

Efficient calculation of available space for multi-NUMA virtual machines
by: Gudkov, Andrei, et al.
Published: (2026)

Efficient Distributed Data Structures for Future Many-core Architectures
by: Fatourou, Panagiota, et al.
Published: (2024)

ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting
by: Shovan, S. M., et al.
Published: (2025)

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
by: Dang'ana, Michael
Published: (2026)

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
by: Chang, Yi-Jun
Published: (2023)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
by: Chang, Yi-Jun, et al.
Published: (2026)

Accelerating Sparse Tensor Decomposition Using Adaptive Linearized Representation
by: Laukemann, Jan, et al.
Published: (2024)

MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads
by: Manor, Daniel, et al.
Published: (2025)

Sorting in One and Two Rounds using $t$-Comparators
by: Gelles, Ran, et al.
Published: (2024)

Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
by: Censor-Hillel, Keren, et al.
Published: (2023)

Designing Parallel Algorithms for Community Detection using Arachne
by: Li, Fuhuan, et al.
Published: (2025)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)

Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)

Perfect Matching with Few Link Activations
by: Mirault, Hugo, et al.
Published: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
by: Ghaffari, Mohsen, et al.
Published: (2025)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
by: Feist, Dankrad, et al.
Published: (2025)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
by: Gil, Yuval, et al.
Published: (2025)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
by: McCoy, Hunter, et al.
Published: (2025)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
by: Baumecker, Malte, et al.
Published: (2025)

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
by: Dindoost, Mohammad, et al.
Published: (2025)

Improved Byzantine Agreement under an Adaptive Adversary
by: Dufoulon, Fabien, et al.
Published: (2025)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
by: Mordacchini, Matteo, et al.
Published: (2025)