BerryBees: Breadth First Search by Bit-Tensor-Cores

Yuyao Niu, Marc Casas · 2025

Breadth First Search (BFS) plays a key role in computational science, networking, and artificial intelligence applications. Although the BFS approach has been extensively studied, particularly in its direction-optimized form, existing implementations still present three main issues: (1) high memory footprint; (2) the under-realized lightweight representations using bitmaps; and (3) the underuse of modern hardware such as Tensor Cores Units (TCUs).

Read the paper · More papers on PaperTik