{"id":"https://openalex.org/W2086352674","doi":"https://doi.org/10.1145/1148109.1148154","title":"A performance analysis of local synchronization","display_name":"A performance analysis of local synchronization","publication_year":2006,"publication_date":"2006-07-30","ids":{"openalex":"https://openalex.org/W2086352674","doi":"https://doi.org/10.1145/1148109.1148154","mag":"2086352674"},"language":"en","primary_location":{"id":"doi:10.1145/1148109.1148154","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"conference-paper","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/A5024316424","display_name":"Julia Lipman","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Julia Lipman","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044655940","display_name":"Quentin F. Stout","orcid":"https://orcid.org/0000-0002-8047-7348"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Quentin F. Stout","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.4701,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.57308759,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"3","issue":null,"first_page":"254","last_page":"260"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9980999827384949,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9980999827384949,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9937999844551086,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.993399977684021,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.7641887664794922},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7331506013870239},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6186744570732117},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5998656153678894},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5522156953811646},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5076340436935425},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48445677757263184},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37283608317375183},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26801541447639465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18206152319908142},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10722637176513672}],"concepts":[{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.7641887664794922},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7331506013870239},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6186744570732117},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5998656153678894},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5522156953811646},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5076340436935425},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48445677757263184},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37283608317375183},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26801541447639465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18206152319908142},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10722637176513672},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1148109.1148154","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.81.7439","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.7439","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/~qstout/pap/SPAA06synch.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7300000190734863}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1551177513","https://openalex.org/W1739983698","https://openalex.org/W1805697744","https://openalex.org/W1986945169","https://openalex.org/W2040525329","https://openalex.org/W2127135373","https://openalex.org/W2127379317","https://openalex.org/W2144580312","https://openalex.org/W2149018370","https://openalex.org/W2153364911","https://openalex.org/W2914659449","https://openalex.org/W4205241946","https://openalex.org/W4285719527","https://openalex.org/W6600485411","https://openalex.org/W6679306998","https://openalex.org/W6724818412"],"related_works":["https://openalex.org/W3013085049","https://openalex.org/W1560496689","https://openalex.org/W1992739770","https://openalex.org/W4386900933","https://openalex.org/W4229058035","https://openalex.org/W3125672081","https://openalex.org/W2006389905","https://openalex.org/W4297797135","https://openalex.org/W2158905189","https://openalex.org/W4319874546"],"abstract_inverted_index":{"Synchronization":[0],"is":[1,16,25,86,98,123,176,213,231],"often":[2,87],"necessary":[3],"in":[4,33,53,66,82,165,263],"parallel":[5],"computing,":[6],"but":[7],"it":[8,77,140],"can":[9],"create":[10],"delays":[11],"whenever":[12],"the":[13,20,46,90,111,120,128,138,161,166,174,181,198,210,228,237,244],"receiving":[14],"processor":[15,36,69,144,266],"idle,":[17],"waiting":[18],"for":[19,28,142,189,223,243,255,268],"information":[21],"to":[22,101,145],"arrive.":[23],"This":[24],"especially":[26],"true":[27],"barrier,":[29],"or":[30],"global,":[31],"synchronization,":[32,65,172],"which":[34,67,76,264],"every":[35,40],"must":[37],"synchronize":[38],"with":[39,72,134,180],"other":[41],"processor.":[42],"Nonetheless,":[43],"barriers":[44],"are":[45,131,206],"only":[47,71,269],"form":[48],"of":[49,92,156,163,183,197,216,239,258,272],"synchronization":[50,97,121,150,211,261],"explicitly":[51],"supplied":[52],"MPI":[54],"and":[55,127,209],"OpenMP.Many":[56],"applications":[57],"do":[58,105],"not":[59,106],"actually":[60],"require":[61],"global":[62,171],"synchronization;":[63],"local":[64,96],"a":[68,93,124,143,147,194,259,265,270],"synchronizes":[70],"those":[73],"processors":[74,104,164,240],"from":[75],"has":[78],"an":[79,153],"incoming":[80],"edge":[81],"some":[83,224,256],"directed":[84,125,245],"graph,":[85],"adequate.":[88],"However,":[89],"behavior":[91],"system":[94],"under":[95],"more":[99],"difficult":[100],"analyze,":[102],"since":[103],"all":[107],"start":[108],"tasks":[109,205],"at":[110],"same":[112],"time.In":[113],"this":[114],"paper,":[115],"we":[116,248],"show":[117,249],"that":[118,202,222,250],"if":[119],"graph":[122,212,215],"cycle":[126,167],"task":[129],"times":[130],"geometrically":[132],"distributed":[133,208],"p":[135,190],"=":[136],"0.5,":[137],"time":[139,175],"takes":[141],"complete":[146],"task,":[148],"including":[149],"time,":[151],"approaches":[152,168],"exact":[154],"limit":[155],"2":[157],"+":[158],"\u221a2":[159],"as":[160,236],"number":[162,182,238],"infinity.":[169],"Under":[170],"however,":[173],"unbounded,":[177],"increasing":[178],"logarithmically":[179],"processors.":[184],"Similar":[185],"results":[186],"also":[187,220],"apply":[188,203,254],"\u2260":[191],"0.5.We":[192],"give":[193],"new":[195],"proof":[196],"constant":[199,233,251],"upper":[200,234,252],"bounds":[201,253],"when":[204],"normally":[207],"any":[214],"bounded":[217],"degree.":[218],"We":[219],"prove":[221],"power-law":[225],"distributions":[226],"on":[227],"tasks,":[229],"there":[230],"no":[232],"bound":[235],"increases,":[241],"even":[242],"cycle.":[246],"Finally,":[247],"cases":[257],"different":[260],"model":[262],"waits":[267],"subset":[271],"its":[273],"neighbors.":[274]},"counts_by_year":[{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}