~/talk

Parallel Cluster-BFS and Applications to Shortest Paths

Talkat Managing Parallelism 2025 · 2025-10-20..10-24· [distributed-systems]
links:none on file
slides:none on file

Parallel cluster-BFS implements simultaneous BFS from a cluster by combining bitwise parallelism with thread-level parallelism, with work O(d m (k/w + 1)) and span O(d log n). An optimized C++ implementation on a 96-core machine processes 640 sources per graph (clusters size 64, diameter 2) and yields up to >1000x speedups and a ~500x geomean speedup versus running single-source BFSes; applied to landmark distance oracles it cuts preprocessing time and usually lowers distortion for the same ~1KB-per-vertex index.

AI-written summary · about

  1. 0:00Parallel cluster-BFS intro
  2. 1:25What is cluster-BFS
  3. 6:45Parallelizing with bitwise & threads
  4. 10:21Algorithm overview & optimizations
  5. 13:12Theoretical guarantees
  6. 16:07Approximate distance oracles
  7. 18:22Experimental results
  8. 21:14Scalability & performance
  9. 24:03Future work & summary
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.