{"id":"https://openalex.org/W2118599219","doi":"https://doi.org/10.1109/ipdps.2008.4536346","title":"A scalable, asynchronous spanning tree algorithm on a cluster of SMPs","display_name":"A scalable, asynchronous spanning tree algorithm on a cluster of SMPs","publication_year":2008,"publication_date":"2008-04-01","ids":{"openalex":"https://openalex.org/W2118599219","doi":"https://doi.org/10.1109/ipdps.2008.4536346","mag":"2118599219"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2008.4536346","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2008.4536346","pdf_url":null,"source":{"id":"https://openalex.org/S4210174069","display_name":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","issn_l":"1530-2075","issn":["1530-2075"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Parallel and Distributed Processing","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/A5089801879","display_name":"Guojing Cong","orcid":"https://orcid.org/0000-0003-0850-7714"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Guojing Cong","raw_affiliation_strings":["IBM Research Laboratory, Yorktown Heights, NY, USA","IBM Research, Yorktown Heights, NY"],"affiliations":[{"raw_affiliation_string":"IBM Research Laboratory, Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I1341412227"]},{"raw_affiliation_string":"IBM Research, Yorktown Heights, NY","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111987079","display_name":"Hanhong Xue","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hanhong Xue","raw_affiliation_strings":["IBM Systems and Technology Group, Poughkeepsie, NY, USA","IBM System and Technology Group, Poughkeepsie, NY, USA"],"affiliations":[{"raw_affiliation_string":"IBM Systems and Technology Group, Poughkeepsie, NY, USA","institution_ids":[]},{"raw_affiliation_string":"IBM System and Technology Group, Poughkeepsie, NY, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089801879"],"corresponding_institution_ids":["https://openalex.org/I1341412227"],"apc_list":null,"apc_paid":null,"fwci":0.7024,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74345584,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"286","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9980999827384949,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9980999827384949,"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/T11478","display_name":"Caching and Content Delivery","score":0.9979000091552734,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9955999851226807,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8041987419128418},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7165842056274414},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6830493807792664},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6418346166610718},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.6384446024894714},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5112655162811279},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.505403995513916},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.49317091703414917},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4842095375061035},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.44954365491867065},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4176003336906433},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4157077670097351},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4141003489494324},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3660719394683838},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33985885977745056},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.22679099440574646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12302467226982117},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09700042009353638}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8041987419128418},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7165842056274414},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6830493807792664},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6418346166610718},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6384446024894714},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5112655162811279},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.505403995513916},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.49317091703414917},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4842095375061035},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44954365491867065},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4176003336906433},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4157077670097351},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4141003489494324},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3660719394683838},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33985885977745056},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.22679099440574646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12302467226982117},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09700042009353638},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2008.4536346","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2008.4536346","pdf_url":null,"source":{"id":"https://openalex.org/S4210174069","display_name":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","issn_l":"1530-2075","issn":["1530-2075"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Parallel and Distributed Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1641749581","https://openalex.org/W1849362181","https://openalex.org/W1976969221","https://openalex.org/W2004350101","https://openalex.org/W2008620264","https://openalex.org/W2011986160","https://openalex.org/W2013173096","https://openalex.org/W2028583484","https://openalex.org/W2032401773","https://openalex.org/W2066999271","https://openalex.org/W2104085672","https://openalex.org/W2104611474","https://openalex.org/W2109065830","https://openalex.org/W2141662114","https://openalex.org/W2158598102","https://openalex.org/W2997134027","https://openalex.org/W7075647469"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2099915933","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W3116169590","https://openalex.org/W8653221","https://openalex.org/W4297934114"],"abstract_inverted_index":{"Large-scale":[0],"data":[1],"science":[2],"applications":[3],"require":[4],"manipulating":[5],"large":[6],"graphs":[7,33],"distributed":[8,23],"across":[9],"multiple":[10],"processors.":[11],"In":[12],"this":[13],"paper":[14],"we":[15],"present":[16],"our":[17,44],"experimental":[18],"study":[19],"of":[20,36,42,53,65],"an":[21],"asynchronous,":[22],"spanning":[24],"tree":[25],"algorithm":[26,56],"that":[27],"handles":[28],"the":[29,61],"challenging":[30],"random,":[31],"sparse":[32],"with":[34],"billions":[35],"vertices.":[37],"With":[38],"a":[39,51],"constant":[40],"number":[41],"barriers,":[43],"implementation":[45,64],"scales":[46],"to":[47],"1024":[48],"processors":[49],"on":[50,60,68],"cluster":[52],"SMPs.":[54],"Our":[55],"sheds":[57],"new":[58],"light":[59],"design":[62],"and":[63],"graph":[66],"algorithms":[67],"distributed-memory":[69],"machines.":[70]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}