{"id":"https://openalex.org/W4308090189","doi":"https://doi.org/10.1109/hpec55821.2022.9926360","title":"Achieving Speedups for Distributed Graph Biconnectivity","display_name":"Achieving Speedups for Distributed Graph Biconnectivity","publication_year":2022,"publication_date":"2022-09-19","ids":{"openalex":"https://openalex.org/W4308090189","doi":"https://doi.org/10.1109/hpec55821.2022.9926360"},"language":"en","primary_location":{"id":"doi:10.1109/hpec55821.2022.9926360","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec55821.2022.9926360","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070172744","display_name":"Ian Bogle","orcid":"https://orcid.org/0000-0001-6591-8785"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ian Bogle","raw_affiliation_strings":["Rensselaer Polytechnic Institute,Department of Computer Science,Troy,New York,USA","Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rensselaer Polytechnic Institute,Department of Computer Science,Troy,New York,USA","institution_ids":["https://openalex.org/I165799507"]},{"raw_affiliation_string":"Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York, USA","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038499316","display_name":"George M. Slota","orcid":"https://orcid.org/0000-0002-4709-4724"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"George M. Slota","raw_affiliation_strings":["Rensselaer Polytechnic Institute,Department of Computer Science,Troy,New York,USA","Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rensselaer Polytechnic Institute,Department of Computer Science,Troy,New York,USA","institution_ids":["https://openalex.org/I165799507"]},{"raw_affiliation_string":"Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York, USA","institution_ids":["https://openalex.org/I165799507"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14521583,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8749924302101135},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.8626841306686401},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7357768416404724},{"id":"https://openalex.org/keywords/porting","display_name":"Porting","score":0.6594876050949097},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.6335882544517517},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.5745880603790283},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.5149960517883301},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4831544756889343},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46985092759132385},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.46970173716545105},{"id":"https://openalex.org/keywords/distributed-shared-memory","display_name":"Distributed shared memory","score":0.41513964533805847},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34726083278656006},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3216087520122528},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.2984055280685425},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2939326763153076},{"id":"https://openalex.org/keywords/uniform-memory-access","display_name":"Uniform memory access","score":0.1519051492214203},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07910990715026855}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8749924302101135},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8626841306686401},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7357768416404724},{"id":"https://openalex.org/C106251023","wikidata":"https://www.wikidata.org/wiki/Q851989","display_name":"Porting","level":3,"score":0.6594876050949097},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.6335882544517517},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.5745880603790283},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.5149960517883301},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4831544756889343},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46985092759132385},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.46970173716545105},{"id":"https://openalex.org/C39528615","wikidata":"https://www.wikidata.org/wiki/Q1229610","display_name":"Distributed shared memory","level":5,"score":0.41513964533805847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34726083278656006},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3216087520122528},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.2984055280685425},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2939326763153076},{"id":"https://openalex.org/C51290061","wikidata":"https://www.wikidata.org/wiki/Q1936765","display_name":"Uniform memory access","level":4,"score":0.1519051492214203},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07910990715026855},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec55821.2022.9926360","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec55821.2022.9926360","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2026512611","https://openalex.org/W1985165680","https://openalex.org/W2353146130","https://openalex.org/W4245497162","https://openalex.org/W1990817968","https://openalex.org/W2150064838","https://openalex.org/W2784603783","https://openalex.org/W1507921119","https://openalex.org/W2088823210","https://openalex.org/W2383122297"],"abstract_inverted_index":{"As":[0,43],"data":[1],"scales":[2],"continue":[3],"to":[4,78,146],"increase,":[5],"studying":[6],"the":[7,25,147,156],"porting":[8],"and":[9,37,50,104,142,151],"implementation":[10,110,154],"of":[11,27,45,81,121,131,140],"shared":[12,53],"memory":[13,18,54,64],"parallel":[14],"algorithms":[15,90,95],"for":[16,29,100,111,155],"distributed":[17,63,79,109],"architectures":[19],"becomes":[20],"increasingly":[21],"important.":[22],"We":[23,135],"consider":[24],"problem":[26],"biconnectivity":[28,55,114,157],"this":[30],"current":[31],"study,":[32,47],"which":[33],"identifies":[34],"cut":[35,38],"vertices":[36],"edges":[39],"in":[40,96],"a":[41,52,62,129],"graph.":[42],"part":[44],"our":[46,108],"we":[48,76,85],"implemented":[49,99],"optimized":[51],"algorithm":[56,67,150],"based":[57],"on":[58,128],"color":[59],"propagation":[60],"within":[61],"context.":[65],"This":[66],"is":[68],"neither":[69],"work":[70],"nor":[71],"time":[72],"efficient.":[73],"However,":[74],"when":[75,98],"compare":[77],"implementations":[80],"theoretically":[82],"efficient":[83],"algorithms,":[84],"find":[86],"that":[87],"simple":[88],"non-optimal":[89],"can":[91],"greatly":[92],"outperform":[93],"time-efficient":[94],"practice":[97],"real":[101,105],"distributed-memory":[102],"environments":[103],"data.":[106],"Overall,":[107],"computing":[112],"graph":[113],"demonstrates":[115],"an":[116,138],"average":[117,139],"strong":[118],"scaling":[119],"speedup":[120,144],"15":[122],"x":[123],"across":[124],"64":[125],"MPI":[126],"ranks":[127],"suite":[130],"irregular":[132],"real-world":[133],"inputs.":[134],"also":[136],"note":[137],"llx":[141],"7.3x":[143],"relative":[145],"optimal":[148],"serial":[149],"fastest":[152],"shared-memory":[153],"problem,":[158],"respectively.":[159]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}