{"id":"https://openalex.org/W2804488201","doi":"https://doi.org/10.1145/3210377.3210380","title":"Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry","display_name":"Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2804488201","doi":"https://doi.org/10.1145/3210377.3210380","mag":"2804488201"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210380","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210380","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210380","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210380","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Guy E. Blelloch","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Yan Gu","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yan Gu","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Julian Shun","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Julian Shun","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":null,"display_name":"Yihan Sun","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yihan Sun","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":5.3068,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.95516858,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"235","last_page":"246"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6044999957084656},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4894999861717224},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.430400013923645},{"id":"https://openalex.org/keywords/out-of-core-algorithm","display_name":"Out-of-core algorithm","score":0.41999998688697815},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.3813000023365021},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.3659000098705292},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.3635999858379364},{"id":"https://openalex.org/keywords/analysis-of-parallel-algorithms","display_name":"Analysis of parallel algorithms","score":0.3449000120162964}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7749999761581421},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.618399977684021},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6044999957084656},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4894999861717224},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4771000146865845},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.430400013923645},{"id":"https://openalex.org/C79470037","wikidata":"https://www.wikidata.org/wiki/Q279748","display_name":"Out-of-core algorithm","level":2,"score":0.41999998688697815},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.3813000023365021},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.3659000098705292},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.3635999858379364},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.3449000120162964},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34310001134872437},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.33820000290870667},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.3122999966144562},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.2994999885559082},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.2946000099182129},{"id":"https://openalex.org/C7356347","wikidata":"https://www.wikidata.org/wiki/Q1307838","display_name":"Unit square","level":2,"score":0.28349998593330383},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.28200000524520874},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.26910001039505005}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3210377.3210380","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210380","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210380","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1805.05592","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1805.05592","pdf_url":"https://arxiv.org/pdf/1805.05592","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3210377.3210380","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210380","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210380","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1560875024","display_name":"SHF: Medium: Collaborative Research: Automatic Locality Management for Dynamically Scheduled Parallelism","funder_award_id":"1408940","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1574315406","display_name":null,"funder_award_id":"CCF-1408940","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2461472526","display_name":"XPS: FULL: FP: Write-Efficient Parallel Algorithms for Emerging Memory Technologies","funder_award_id":"1533858","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3366761448","display_name":null,"funder_award_id":"CCF-1533858","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7010669580","display_name":null,"funder_award_id":"1629444","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8803023401","display_name":null,"funder_award_id":"CCF-1629444","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2804488201.pdf","grobid_xml":"https://content.openalex.org/works/W2804488201.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W1526462389","https://openalex.org/W1582154559","https://openalex.org/W1593563200","https://openalex.org/W1595208863","https://openalex.org/W1788997585","https://openalex.org/W1910264759","https://openalex.org/W1963700323","https://openalex.org/W1978583881","https://openalex.org/W1987569615","https://openalex.org/W2011119863","https://openalex.org/W2011183953","https://openalex.org/W2011933350","https://openalex.org/W2012714839","https://openalex.org/W2016482138","https://openalex.org/W2020964455","https://openalex.org/W2023518480","https://openalex.org/W2038142281","https://openalex.org/W2041994075","https://openalex.org/W2043148321","https://openalex.org/W2048128011","https://openalex.org/W2058432138","https://openalex.org/W2060978628","https://openalex.org/W2062766966","https://openalex.org/W2062959712","https://openalex.org/W2065457989","https://openalex.org/W2092720654","https://openalex.org/W2099753358","https://openalex.org/W2117169958","https://openalex.org/W2130301020","https://openalex.org/W2142753649","https://openalex.org/W2165558283","https://openalex.org/W2227449090","https://openalex.org/W2240426913","https://openalex.org/W2282989799","https://openalex.org/W2469481711","https://openalex.org/W2473485914","https://openalex.org/W2505049979","https://openalex.org/W2562123954","https://openalex.org/W2738607799","https://openalex.org/W3124031623","https://openalex.org/W4242599275","https://openalex.org/W6636840609","https://openalex.org/W6655161923","https://openalex.org/W6677894098"],"related_works":[],"abstract_inverted_index":{"In":[0,115],"this":[1],"paper,":[2],"we":[3,119,134],"design":[4,53],"parallel":[5,82,142],"write-efficient":[6,143],"geometric":[7],"algorithms":[8,16,54,69],"that":[9,35],"perform":[10],"asymptotically":[11],"fewer":[12],"writes":[13,41,95,107],"than":[14,113],"standard":[15],"for":[17,55,123,139],"the":[18,73,81],"same":[19],"problem.":[20],"This":[21],"is":[22,87],"motivated":[23],"by":[24],"emerging":[25],"non-volatile":[26],"memory":[27,39,91,105],"technologies":[28],"with":[29],"read":[30],"performance":[31],"being":[32,42],"close":[33],"to":[34],"of":[36,48],"random":[37],"access":[38],"but":[40],"significantly":[43],"more":[44,111],"expensive":[45,112],"in":[46,72,84],"terms":[47],"energy":[49],"and":[50,62,64,94,131],"latency.":[51],"We":[52],"planar":[56],"Delaunay":[57],"triangulation,":[58],"k":[59],"-d":[60],"trees,":[61],"static":[63],"dynamic":[65],"augmented":[66],"trees.":[67],"Our":[68],"are":[70,96,108],"designed":[71],"recently":[74],"introduced":[75],"Asymmetric":[76],"Nested-Parallel":[77],"Model,":[78],"which":[79,85,133],"captures":[80],"setting":[83],"there":[86],"a":[88,102],"small":[89],"symmetric":[90],"where":[92,106],"reads":[93],"unit":[97],"cost":[98],"as":[99,101],"well":[100],"large":[103],"asymmetric":[104],"$\u00f8mega$":[109],"times":[110],"reads.":[114],"designing":[116,140],"these":[117],"algorithms,":[118],"introduce":[120],"several":[121],"techniques":[122],"obtaining":[124],"write-efficiency,":[125],"including":[126],"DAG":[127],"tracing,":[128],"prefix":[129],"doubling,":[130],"\u03b1-labeling,":[132],"believe":[135],"will":[136],"be":[137],"useful":[138],"other":[141],"algorithms.":[144]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2018-06-01T00:00:00"}