A computational study of external-memory BFS algorithms

Abstract

Breadth First Search (BFS) traversal is an archetype for many important graph problems. However, computing a BFS level decomposition for massive graphs was considered nonviable so far, because of the large number of I/Os it incurs. This paper presents the first experimental evaluation of recent external-memory BFS algorithms for general graphs. With our STXXL based implementations exploiting pipelining and disk-parallelism, we were able to compute the BFS level decomposition of a web-crawl based graph of around 130 million nodes and 1.4 billion edges in less than 4 hours using single disk and 2.3 hours using 4 disks. We demonstrate that some rather simple external-memory algorithms perform significantly better (<i>minutes</i> as compared to <i>hours</i>) than internal-memory BFS, even if more than half of the input resides internally.

Extracted Key Phrases

14 Figures and Tables

Statistics

0510'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

53 Citations

Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Ajwani2006ACS, title={A computational study of external-memory BFS algorithms}, author={Deepak Ajwani and Roman Dementiev and Ulrich Meyer}, booktitle={SODA}, year={2006} }