Simple parallel biconnectivity algorithms for multicore platforms

George M. Slota, Kamesh Madduri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

We present two new algorithms for finding the biconnected components of a large undirected sparse graph. The first algorithm is based on identifying articulation points and labeling edges using multiple connectivity queries, and the second approach uses the color propagation technique to decompose the graph. Both methods use a breadth-first spanning tree and some auxiliary information computed during Breadth-First Search (BFS). These methods are simpler than the Tarjan-Vishkin PRAM algorithm for biconnectivity and do not require Euler tour computation or any auxiliary graph construction. We identify steps in these algorithms that can be parallelized in a shared-memory environment and develop tuned OpenMP implementations. Using a collection of large-scale real-world graph instances, we show that these methods outperform the state-of-the-art Cong-Bader biconnected components implementation, which is based on the Tarjan-Vishkin algorithm. We achieve up to 7.1× and 4.2× parallel speedup over the serial Hopcroft-Tarjan and parallel Cong-Bader algorithms, respectively, on a 16-core Intel Sandy Bridge system. For some graph instances, due to the fast BFS-based preprocessing step, the single-threaded implementation of our first algorithm is faster than the serial Hopcroft-Tarjan algorithm.

Original languageEnglish (US)
Title of host publication2014 21st International Conference on High Performance Computing, HiPC 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479959761
DOIs
StatePublished - Jan 1 2014
Event2014 21st International Conference on High Performance Computing, HiPC 2014 - Goa, India
Duration: Dec 17 2014Dec 20 2014

Publication series

Name2014 21st International Conference on High Performance Computing, HiPC 2014

Other

Other2014 21st International Conference on High Performance Computing, HiPC 2014
CountryIndia
CityGoa
Period12/17/1412/20/14

Fingerprint

Parallel algorithms
Labeling
Color
Data storage equipment

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)
  • Hardware and Architecture
  • Software

Cite this

Slota, G. M., & Madduri, K. (2014). Simple parallel biconnectivity algorithms for multicore platforms. In 2014 21st International Conference on High Performance Computing, HiPC 2014 [7116914] (2014 21st International Conference on High Performance Computing, HiPC 2014). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/HiPC.2014.7116914
Slota, George M. ; Madduri, Kamesh. / Simple parallel biconnectivity algorithms for multicore platforms. 2014 21st International Conference on High Performance Computing, HiPC 2014. Institute of Electrical and Electronics Engineers Inc., 2014. (2014 21st International Conference on High Performance Computing, HiPC 2014).
@inproceedings{450b309dc0fb472d8829414ce0cd0b58,
title = "Simple parallel biconnectivity algorithms for multicore platforms",
abstract = "We present two new algorithms for finding the biconnected components of a large undirected sparse graph. The first algorithm is based on identifying articulation points and labeling edges using multiple connectivity queries, and the second approach uses the color propagation technique to decompose the graph. Both methods use a breadth-first spanning tree and some auxiliary information computed during Breadth-First Search (BFS). These methods are simpler than the Tarjan-Vishkin PRAM algorithm for biconnectivity and do not require Euler tour computation or any auxiliary graph construction. We identify steps in these algorithms that can be parallelized in a shared-memory environment and develop tuned OpenMP implementations. Using a collection of large-scale real-world graph instances, we show that these methods outperform the state-of-the-art Cong-Bader biconnected components implementation, which is based on the Tarjan-Vishkin algorithm. We achieve up to 7.1× and 4.2× parallel speedup over the serial Hopcroft-Tarjan and parallel Cong-Bader algorithms, respectively, on a 16-core Intel Sandy Bridge system. For some graph instances, due to the fast BFS-based preprocessing step, the single-threaded implementation of our first algorithm is faster than the serial Hopcroft-Tarjan algorithm.",
author = "Slota, {George M.} and Kamesh Madduri",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/HiPC.2014.7116914",
language = "English (US)",
series = "2014 21st International Conference on High Performance Computing, HiPC 2014",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2014 21st International Conference on High Performance Computing, HiPC 2014",
address = "United States",

}

Slota, GM & Madduri, K 2014, Simple parallel biconnectivity algorithms for multicore platforms. in 2014 21st International Conference on High Performance Computing, HiPC 2014., 7116914, 2014 21st International Conference on High Performance Computing, HiPC 2014, Institute of Electrical and Electronics Engineers Inc., 2014 21st International Conference on High Performance Computing, HiPC 2014, Goa, India, 12/17/14. https://doi.org/10.1109/HiPC.2014.7116914

Simple parallel biconnectivity algorithms for multicore platforms. / Slota, George M.; Madduri, Kamesh.

2014 21st International Conference on High Performance Computing, HiPC 2014. Institute of Electrical and Electronics Engineers Inc., 2014. 7116914 (2014 21st International Conference on High Performance Computing, HiPC 2014).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Simple parallel biconnectivity algorithms for multicore platforms

AU - Slota, George M.

AU - Madduri, Kamesh

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We present two new algorithms for finding the biconnected components of a large undirected sparse graph. The first algorithm is based on identifying articulation points and labeling edges using multiple connectivity queries, and the second approach uses the color propagation technique to decompose the graph. Both methods use a breadth-first spanning tree and some auxiliary information computed during Breadth-First Search (BFS). These methods are simpler than the Tarjan-Vishkin PRAM algorithm for biconnectivity and do not require Euler tour computation or any auxiliary graph construction. We identify steps in these algorithms that can be parallelized in a shared-memory environment and develop tuned OpenMP implementations. Using a collection of large-scale real-world graph instances, we show that these methods outperform the state-of-the-art Cong-Bader biconnected components implementation, which is based on the Tarjan-Vishkin algorithm. We achieve up to 7.1× and 4.2× parallel speedup over the serial Hopcroft-Tarjan and parallel Cong-Bader algorithms, respectively, on a 16-core Intel Sandy Bridge system. For some graph instances, due to the fast BFS-based preprocessing step, the single-threaded implementation of our first algorithm is faster than the serial Hopcroft-Tarjan algorithm.

AB - We present two new algorithms for finding the biconnected components of a large undirected sparse graph. The first algorithm is based on identifying articulation points and labeling edges using multiple connectivity queries, and the second approach uses the color propagation technique to decompose the graph. Both methods use a breadth-first spanning tree and some auxiliary information computed during Breadth-First Search (BFS). These methods are simpler than the Tarjan-Vishkin PRAM algorithm for biconnectivity and do not require Euler tour computation or any auxiliary graph construction. We identify steps in these algorithms that can be parallelized in a shared-memory environment and develop tuned OpenMP implementations. Using a collection of large-scale real-world graph instances, we show that these methods outperform the state-of-the-art Cong-Bader biconnected components implementation, which is based on the Tarjan-Vishkin algorithm. We achieve up to 7.1× and 4.2× parallel speedup over the serial Hopcroft-Tarjan and parallel Cong-Bader algorithms, respectively, on a 16-core Intel Sandy Bridge system. For some graph instances, due to the fast BFS-based preprocessing step, the single-threaded implementation of our first algorithm is faster than the serial Hopcroft-Tarjan algorithm.

UR - http://www.scopus.com/inward/record.url?scp=84977958646&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84977958646&partnerID=8YFLogxK

U2 - 10.1109/HiPC.2014.7116914

DO - 10.1109/HiPC.2014.7116914

M3 - Conference contribution

T3 - 2014 21st International Conference on High Performance Computing, HiPC 2014

BT - 2014 21st International Conference on High Performance Computing, HiPC 2014

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Slota GM, Madduri K. Simple parallel biconnectivity algorithms for multicore platforms. In 2014 21st International Conference on High Performance Computing, HiPC 2014. Institute of Electrical and Electronics Engineers Inc. 2014. 7116914. (2014 21st International Conference on High Performance Computing, HiPC 2014). https://doi.org/10.1109/HiPC.2014.7116914