BerryBees: Breadth First Search by Bit-Tensor-Cores
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).
Authors
- Yuyao Niu (ORCID: https://orcid.org/0000-0001-7605-525X)
- Marc Casas (ORCID: https://orcid.org/0000-0003-4564-2093)
Institutions
- Barcelona Supercomputing Center (ES)
- Universitat Politècnica de Catalunya (ES)
Publication Details
- Published
- 2025-02-28
- DOI
- https://doi.org/10.1145/3710848.3710859
- Citations
- 5
- Primary Topic
- Graph Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 6.38
Funders
- Generalitat de Catalunya
- Ministerio de Ciencia e Innovación
- Agencia Estatal de Investigación
- European Social Fund