Ian Bogle

Ian Bogle

Auto-generated profile, based on publicly available information

Ian Bogle

Rensselaer Polytechnic Institute,Computer Science Department,Troy,NY

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 February 2022 in Parallel Computing
Verified
Journal Article
Closed access
IBIan Bogle
Ian Bogle
GSGeorge M. Slota
George M. Slota
EBErik G. Boman
Erik G. Boman
KDKaren D. Devine
Karen D. Devine
SRSivasankaran Rajamanickam
Sivasankaran Rajamanickam

1 May 2022
Verified
Conference Paper
Closed access
IBIan Bogle
Ian Bogle
GSGeorge M. Slota
George M. Slota
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.