{"id":"https://openalex.org/W2020022171","doi":"https://doi.org/10.1109/ipdps.2010.5470440","title":"Parallel external memory graph algorithms","display_name":"Parallel external memory graph algorithms","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2020022171","doi":"https://doi.org/10.1109/ipdps.2010.5470440","mag":"2020022171"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2010.5470440","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2010.5470440","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)","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/A5084056010","display_name":"Lars Arge","orcid":null},"institutions":[{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lars Arge","raw_affiliation_strings":["MADALGO, University of Aarhus, Aarhus, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MADALGO, University of Aarhus, Aarhus, Denmark","institution_ids":["https://openalex.org/I4210095128"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034971300","display_name":"Michael T. Goodrich","orcid":"https://orcid.org/0000-0002-8943-191X"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael T. Goodrich","raw_affiliation_strings":["University of California, Irvine, Irvine, CA, USA","University of California Irvine, IRVINE, CA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Irvine, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"University of California Irvine, IRVINE, CA, USA#TAB#","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015446804","display_name":"Nodari Sitchinava","orcid":"https://orcid.org/0000-0001-8876-4846"},"institutions":[{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Nodari Sitchinava","raw_affiliation_strings":["MADALGO, University of Aarhus, Aarhus, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MADALGO, University of Aarhus, Aarhus, Denmark","institution_ids":["https://openalex.org/I4210095128"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.0604,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.95641264,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10829","display_name":"Interconnection Networks and Systems","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/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8281777501106262},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6762813329696655},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4931292235851288},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.48471975326538086},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4598574936389923},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.42592862248420715},{"id":"https://openalex.org/keywords/biconnected-graph","display_name":"Biconnected graph","score":0.41825246810913086},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35564637184143066},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.20757919549942017},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17870911955833435},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.08340650796890259}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8281777501106262},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6762813329696655},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4931292235851288},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.48471975326538086},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4598574936389923},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.42592862248420715},{"id":"https://openalex.org/C45725084","wikidata":"https://www.wikidata.org/wiki/Q4390447","display_name":"Biconnected graph","level":5,"score":0.41825246810913086},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35564637184143066},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.20757919549942017},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17870911955833435},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.08340650796890259}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/ipdps.2010.5470440","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2010.5470440","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.135.8426","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.8426","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/~nodari/graph_pem.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.144.5610","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.5610","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/~nodari/graph_pem.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.220.834","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.834","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/~nodari/graph_pem.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.298.7609","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.7609","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.uci.edu/~nodari/graph_pem.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/9390e120-e5ae-11df-a891-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/9390e120-e5ae-11df-a891-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Arge, L A, Goodrich, M T & Sitchinava, N 2010, 'Parallel External Memory Graph Algorithms', I P D P S Proceedings, pp. 1-11. https://doi.org/10.1109/IPDPS.2010.5470440","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320324281","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W103797413","https://openalex.org/W1480005827","https://openalex.org/W1513982482","https://openalex.org/W1523679426","https://openalex.org/W1574726470","https://openalex.org/W1586466644","https://openalex.org/W1640663027","https://openalex.org/W1766349993","https://openalex.org/W1949076312","https://openalex.org/W1967838552","https://openalex.org/W1975934607","https://openalex.org/W1978278938","https://openalex.org/W1990262300","https://openalex.org/W1994949308","https://openalex.org/W1995040285","https://openalex.org/W1998017993","https://openalex.org/W2004350101","https://openalex.org/W2013444956","https://openalex.org/W2026842524","https://openalex.org/W2027637765","https://openalex.org/W2038142281","https://openalex.org/W2045271686","https://openalex.org/W2057839002","https://openalex.org/W2061303458","https://openalex.org/W2067661972","https://openalex.org/W2069446854","https://openalex.org/W2078089286","https://openalex.org/W2092901467","https://openalex.org/W2097755092","https://openalex.org/W2104644701","https://openalex.org/W2120490947","https://openalex.org/W2121653690","https://openalex.org/W2122001721","https://openalex.org/W2123145425","https://openalex.org/W2131264486","https://openalex.org/W2145252892","https://openalex.org/W2152951955","https://openalex.org/W2152971387","https://openalex.org/W2154995125","https://openalex.org/W2173213060","https://openalex.org/W2395933225","https://openalex.org/W2711285122","https://openalex.org/W6644841343","https://openalex.org/W6656899617","https://openalex.org/W6665308329","https://openalex.org/W6678137034","https://openalex.org/W6679634795"],"related_works":["https://openalex.org/W2317245370","https://openalex.org/W4249323025","https://openalex.org/W198851386","https://openalex.org/W2030310580","https://openalex.org/W947442053","https://openalex.org/W1980160788","https://openalex.org/W2283866686","https://openalex.org/W4287182096","https://openalex.org/W27867058","https://openalex.org/W2148915962"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"study":[4,27,57],"parallel":[5,99,103],"I/O":[6,100],"efficient":[7,37],"graph":[8,76],"algorithms":[9],"in":[10,98],"the":[11,20,28,58,62,108],"Parallel":[12],"External":[13],"Memory":[14],"(PEM)":[15],"model,":[16],"one":[17],"o":[18],"f":[19],"private-cache":[21],"chip":[22],"multiprocessor":[23],"(CMP)":[24],"models.":[25],"We":[26,55],"fundamental":[29],"problem":[30],"of":[31,60,67,73,80,96],"list":[32],"ranking":[33],"which":[34],"leads":[35],"to":[36,39,107],"solutions":[38,86],"problems":[40,59],"on":[41,87],"trees,":[42],"such":[43],"as":[44],"computing":[45,61],"lowest":[46],"common":[47],"ancestors,":[48],"tree":[49,53,72],"contraction":[50],"and":[51,64,77,102],"expression":[52],"evaluation.":[54],"also":[56],"connected":[63,75],"biconnected":[65,82],"components":[66],"a":[68,74,81,88],"graph,":[69],"minimum":[70],"spanning":[71],"ear":[78],"decomposition":[79],"graph.":[83],"All":[84],"our":[85],"P-processor":[89],"PEM":[90],"model":[91],"provide":[92],"an":[93],"optimal":[94],"speedup":[95],"\u00bf(P)":[97],"complexity":[101],"computation":[104],"time,":[105],"compared":[106],"single-processor":[109],"external":[110],"memory":[111],"counterparts.":[112]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":6}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}