Ian Bogle
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ian Bogle has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- George M. Slota
Rensselaer Polytechnic Institute
2 shared publications - Erik Gunnar Boman
Sandia National Laboratories, Albuquerque, New Mexico, USA
1 shared publication - Karen D. Devine
Retired, Starkville, Mississippi, USA
1 shared publication - Sivasankaran Rajamanickam
Sandia National Laboratories, Albuquerque, NM, USA
1 shared publication
Latest Publications
- 1 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1139-1142
Distributed Algorithms for the Graph Biconnectivity and Least Common Ancestor Problems
Graph connectivity analysis is one of the primary ways to analyze the topological structure of social networks. Graph biconnectivity decompositions are of particular interest due to how they identify cut vertices and cut edges in a network. We present the first, to our knowledge, implementation of a distributed-memory parallel biconnectivity algorithm. As part of our algorithm, we also require the computation of least common ancestors (LCAs) of non-tree edge endpoints in a BFS tree. As such, we also propose a novel distributed algorithm for the LCA problem. Using our implementations, we observe up to a 14.8× speedup from 1 to 128 MPI ranks for computing a biconnectivity decomposition.
- 1 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1139-1142
Distributed Algorithms for the Graph Biconnectivity and Least Common Ancestor Problems
Graph connectivity analysis is one of the primary ways to analyze the topological structure of social networks. Graph biconnectivity decompositions are of particular interest due to how they identify cut vertices and cut edges in a network. We present the first, to our knowledge, implementation of a distributed-memory parallel biconnectivity algorithm. As part of our algorithm, we also require the computation of least common ancestors (LCAs) of non-tree edge endpoints in a BFS tree. As such, we also propose a novel distributed algorithm for the LCA problem. Using our implementations, we observe up to a 14.8× speedup from 1 to 128 MPI ranks for computing a biconnectivity decomposition.
- 5 February 2022
- Published by Elsevier in Parallel Computing
- Vol. 110
Parallel graph coloring algorithms for distributed GPU environments
- 5 February 2022
- Published by Elsevier in Parallel Computing
- Vol. 110
Parallel graph coloring algorithms for distributed GPU environments