{"id":"https://openalex.org/W1997762592","doi":"https://doi.org/10.1145/1065944.1065949","title":"A linear-time algorithm for optimal barrier placement","display_name":"A linear-time algorithm for optimal barrier placement","publication_year":2005,"publication_date":"2005-06-15","ids":{"openalex":"https://openalex.org/W1997762592","doi":"https://doi.org/10.1145/1065944.1065949","mag":"1997762592"},"language":"en","primary_location":{"id":"doi:10.1145/1065944.1065949","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1065944.1065949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming","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/A5058222450","display_name":"Alain Darte","orcid":null},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Alain Darte","raw_affiliation_strings":["CNRS, LIP, ENS Lyon, Lyon, France","CNRS - LIP ENS Lyon, Lyon, France"],"affiliations":[{"raw_affiliation_string":"CNRS, LIP, ENS Lyon, Lyon, France","institution_ids":["https://openalex.org/I113428412","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"CNRS - LIP ENS Lyon, Lyon, France","institution_ids":["https://openalex.org/I4210144566","https://openalex.org/I1294671590","https://openalex.org/I113428412"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030605442","display_name":"Robert Schreiber","orcid":"https://orcid.org/0000-0002-3057-5820"},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Schreiber","raw_affiliation_strings":["Hewlett Packard Laboratories, Palo Alto, CA","Hewlett-Packard Laboratories, Palo Alto. Ca#TAB#"],"affiliations":[{"raw_affiliation_string":"Hewlett Packard Laboratories, Palo Alto, CA","institution_ids":["https://openalex.org/I1324840837"]},{"raw_affiliation_string":"Hewlett-Packard Laboratories, Palo Alto. Ca#TAB#","institution_ids":["https://openalex.org/I1324840837"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058222450"],"corresponding_institution_ids":["https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I4210144566"],"apc_list":null,"apc_paid":null,"fwci":0.7734,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.73203656,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"26","last_page":"35"},"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.9995999932289124,"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.9995999932289124,"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.998199999332428,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6429396867752075},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6207379102706909},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.5588814616203308},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5370302200317383},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.508815586566925},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4921802580356598},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4453220069408417},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4179014563560486},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4083424210548401},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3943619728088379},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17809101939201355},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.16183170676231384}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6429396867752075},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6207379102706909},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.5588814616203308},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5370302200317383},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.508815586566925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4921802580356598},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4453220069408417},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4179014563560486},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4083424210548401},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3943619728088379},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17809101939201355},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.16183170676231384},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1065944.1065949","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1065944.1065949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming","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":11,"referenced_works":["https://openalex.org/W2001738739","https://openalex.org/W2006048213","https://openalex.org/W2012394090","https://openalex.org/W2033214895","https://openalex.org/W2065413511","https://openalex.org/W2096302643","https://openalex.org/W2098683869","https://openalex.org/W2112482891","https://openalex.org/W2295450001","https://openalex.org/W4300123403","https://openalex.org/W6676870935"],"related_works":["https://openalex.org/W2002177687","https://openalex.org/W2058438338","https://openalex.org/W2019471580","https://openalex.org/W2941284322","https://openalex.org/W2141424423","https://openalex.org/W2168299207","https://openalex.org/W4224920876","https://openalex.org/W2080027614","https://openalex.org/W2123377008","https://openalex.org/W2248664270"],"abstract_inverted_index":{"We":[0,59,96],"want":[1],"to":[2,15,35,66],"perform":[3],"compile-time":[4],"analysis":[5],"of":[6,23,54,56,70,88],"an":[7],"SPMD":[8],"program":[9],"and":[10],"place":[11],"barriers":[12],"in":[13],"it":[14,17],"synchronize":[16],"correctly,":[18],"minimizing":[19],"the":[20,24,28,36,44,112],"runtime":[21],"cost":[22],"synchronization.":[25],"This":[26,109],"is":[27,64,94],"barrier":[29,62,113],"minimization":[30,63,114],"problem.":[31],"No":[32],"full":[33],"solution":[34,103],"problem":[37,45,115],"has":[38],"been":[39],"given":[40],"previously.Here":[41],"we":[42],"model":[43],"with":[46],"a":[47,51,68,80,85,91,101],"new":[48],"combinatorial":[49],"structure,":[50],"nested":[52,105,118],"family":[53,87],"sets":[55,74],"circular":[57,89,106],"intervals.":[58,78],"show":[60],"that":[61,75],"equivalent":[65],"finding":[67,100],"hierarchy":[69],"minimum":[71],"cardinality":[72],"point":[73],"cut":[76],"all":[77],"For":[79],"single":[81],"loop,":[82],"modeled":[83],"as":[84],"simple":[86],"intervals,":[90],"linear-time":[92,102],"algorithm":[93],"known.":[95],"extend":[97],"this":[98],"result,":[99],"for":[104,116],"interval":[107],"families.":[108],"result":[110],"solves":[111],"general":[117],"loops.":[119]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}