{"id":"https://openalex.org/W2935959957","doi":"https://doi.org/10.1145/3323165.3323209","title":"Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths","display_name":"Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2935959957","doi":"https://doi.org/10.1145/3323165.3323209","mag":"2935959957"},"language":"en","primary_location":{"id":"doi:10.1145/3323165.3323209","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3323165.3323209","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3323165.3323209","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3323165.3323209","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Rathish Das","orcid":null},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rathish Das","raw_affiliation_strings":["Stony Brook University, Stony Brook, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, Stony Brook, NY, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Shih-Yu Tsai","orcid":null},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shih-Yu Tsai","raw_affiliation_strings":["Stony Brook University, Stony Brook, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, Stony Brook, NY, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Sharmila Duppala","orcid":null},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sharmila Duppala","raw_affiliation_strings":["Stony Brook University, Stony Brook, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, Stony Brook, NY, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Jayson Lynch","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":"Jayson Lynch","raw_affiliation_strings":["Massachusetts Institute of Technology, Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Boston, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Esther M. Arkin","orcid":null},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Esther M. Arkin","raw_affiliation_strings":["Stony Brook University, Stony Brook, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, Stony Brook, NY, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Rezaul Chowdhury","orcid":null},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rezaul Chowdhury","raw_affiliation_strings":["Stony Brook University, Stony Brook, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, Stony Brook, NY, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Joseph S. B. Mitchell","orcid":null},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph S. B. Mitchell","raw_affiliation_strings":["Stony Brook University, Stony Brook, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, Stony Brook, NY, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"last","author":{"id":null,"display_name":"Steven Skiena","orcid":null},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steven Skiena","raw_affiliation_strings":["Stony Brook University, Stony Brook, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, Stony Brook, NY, USA","institution_ids":["https://openalex.org/I59553526"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"359","last_page":"368"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994999766349792,"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.9994999766349792,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6539999842643738},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.47119998931884766},{"id":"https://openalex.org/keywords/associative-property","display_name":"Associative property","score":0.4564000070095062},{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.44760000705718994},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4449000060558319},{"id":"https://openalex.org/keywords/serialization","display_name":"Serialization","score":0.44350001215934753},{"id":"https://openalex.org/keywords/determinacy","display_name":"Determinacy","score":0.41190001368522644},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.41119998693466187},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.3628999888896942},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.3450999855995178}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7597000002861023},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6539999842643738},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5360000133514404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5156999826431274},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.47119998931884766},{"id":"https://openalex.org/C159423971","wikidata":"https://www.wikidata.org/wiki/Q177251","display_name":"Associative property","level":2,"score":0.4564000070095062},{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.44760000705718994},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4449000060558319},{"id":"https://openalex.org/C52723943","wikidata":"https://www.wikidata.org/wiki/Q1127410","display_name":"Serialization","level":2,"score":0.44350001215934753},{"id":"https://openalex.org/C58468513","wikidata":"https://www.wikidata.org/wiki/Q1201165","display_name":"Determinacy","level":2,"score":0.41190001368522644},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.41119998693466187},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4009999930858612},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.3628999888896942},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.3450999855995178},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C55526617","wikidata":"https://www.wikidata.org/wiki/Q719375","display_name":"Operand","level":2,"score":0.3228999972343445},{"id":"https://openalex.org/C47487241","wikidata":"https://www.wikidata.org/wiki/Q5227230","display_name":"Data access","level":2,"score":0.3142000138759613},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.3109000027179718},{"id":"https://openalex.org/C154504017","wikidata":"https://www.wikidata.org/wiki/Q853614","display_name":"Identifier","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30329999327659607},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.2856000065803528},{"id":"https://openalex.org/C162932704","wikidata":"https://www.wikidata.org/wiki/Q1058791","display_name":"Synchronizing","level":3,"score":0.2806999981403351},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C144240696","wikidata":"https://www.wikidata.org/wiki/Q367204","display_name":"Address space","level":2,"score":0.26840001344680786},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.2653999924659729},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2637999951839447},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25600001215934753},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.25270000100135803},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.2526000142097473},{"id":"https://openalex.org/C95203288","wikidata":"https://www.wikidata.org/wiki/Q221682","display_name":"Semaphore","level":2,"score":0.2517000138759613},{"id":"https://openalex.org/C183778304","wikidata":"https://www.wikidata.org/wiki/Q165474","display_name":"Commutative property","level":2,"score":0.25099998712539673},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3323165.3323209","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3323165.3323209","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3323165.3323209","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1904.09283","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1904.09283","pdf_url":"https://arxiv.org/pdf/1904.09283","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/3323165.3323209","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3323165.3323209","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3323165.3323209","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1124548093","display_name":"CAREER: A Unified Framework for Designing Efficient  Resource-Oblivious Parallel Algorithms","funder_award_id":"1553510","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1368137689","display_name":null,"funder_award_id":"CCF-1526406","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1369922885","display_name":"CCF-BSF: AF: Small: Collaborative Research: The Dictionary Problem Considered","funder_award_id":"1716252","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1789788648","display_name":"AF: Small: Collaborative Research: Maintaining Order","funder_award_id":"1617618","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2231274329","display_name":"BIGDATA: F: DeepWalking Graphs for Feature Extraction","funder_award_id":"1546113","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2902473203","display_name":null,"funder_award_id":"CCF-1725543","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2963653684","display_name":"SPX: Collaborative Research: Harnessing the Power of High-Bandwidth Memory via Provably Efficient Parallel Algorithms","funder_award_id":"1725543","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3099827749","display_name":"CSR: Medium: Collaborative Research: FTFS: A Read/Write-Optimized Fractal Tree File System","funder_award_id":"1408695","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3146337093","display_name":"CSR: Medium: Approximate Membership Query Data Structures in Computational Biology and Storage","funder_award_id":"1763680","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3728001206","display_name":null,"funder_award_id":"CNS-1408695","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4300546193","display_name":null,"funder_award_id":"CCF-1439084, CNS-1553510, IIS-1546113, CCF-1526406","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4926662827","display_name":"XPS: FULL: CCA: Collaborative Research: Cache-Adaptive Algorithms: How to Share Core among Many Cores","funder_award_id":"1439084","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5146509126","display_name":null,"funder_award_id":"CCF-1745331","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5175347774","display_name":null,"funder_award_id":"CCF-1439084","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5435976661","display_name":"CSR: Medium: Collaborative Research: FTFS: A Read/Write-Optimized Fractal Tree File System","funder_award_id":"1755615","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G54751696","display_name":"AF:  Small:  Approximation Algorithms for Geometric Network Optimization","funder_award_id":"1526406","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7097317338","display_name":null,"funder_award_id":"CSR-1763680","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7410429640","display_name":null,"funder_award_id":"CNS-1553510","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8079901054","display_name":"Hawaiian Workshop on Parallel Algorithms and Data Structures","funder_award_id":"1745331","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G81772460","display_name":null,"funder_award_id":"CNS-1755615","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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2935959957.pdf","grobid_xml":"https://content.openalex.org/works/W2935959957.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W160833953","https://openalex.org/W1965557301","https://openalex.org/W1967030015","https://openalex.org/W1972955159","https://openalex.org/W1975231449","https://openalex.org/W1988888548","https://openalex.org/W1993720874","https://openalex.org/W1995085071","https://openalex.org/W1998370163","https://openalex.org/W2003011182","https://openalex.org/W2032401773","https://openalex.org/W2034256728","https://openalex.org/W2035871154","https://openalex.org/W2041242446","https://openalex.org/W2052423850","https://openalex.org/W2057913648","https://openalex.org/W2086190489","https://openalex.org/W2105754437","https://openalex.org/W2134435031","https://openalex.org/W2150446509","https://openalex.org/W2155467293","https://openalex.org/W2166566648","https://openalex.org/W2172013743","https://openalex.org/W3024745949","https://openalex.org/W4230708893","https://openalex.org/W4234858060","https://openalex.org/W4238937905"],"related_works":[],"abstract_inverted_index":{"A":[0,41],"determinacy":[1,50],"race":[2,43,51],"occurs":[3],"if":[4,335],"two":[5,280],"or":[6,67],"more":[7,120],"logically":[8],"parallel":[9,103,121,159],"instructions":[10],"access":[11],"the":[12,62,107,130,135,141,153,171,182,192,262,268,276,288,325,336,342,359,370],"same":[13],"memory":[14,63,93,162,209],"location":[15,64],"and":[16,37,88,168,211,264,287,319,352,375],"at":[17,106],"least":[18],"one":[19,95],"of":[20,48,109,134,148,155,194,236,250,261,270,283,298,324,367],"them":[21],"tries":[22],"to":[23,35,71,83,91,119,127,180,258,308],"modify":[24],"its":[25],"content.":[26],"Races":[27],"are":[28],"often":[29],"undesirable":[30],"as":[31,224,295],"they":[32],"can":[33,53,76,96,197],"lead":[34],"nondeterministic":[36],"incorrect":[38],"program":[39,196],"behavior.":[40],"data":[42],"is":[44,244,339,344],"a":[45,49,58,92,99,145,158,195,201,234,254,285,296,309,377],"special":[46],"case":[47],"which":[52,101,123,161],"be":[54,165,173,198],"eliminated":[55],"by":[56,79,139,200,246],"associating":[57],"mutual-exclusion":[59],"lock":[60],"with":[61,206,314],"in":[65,124,157,178,267],"question":[66,223],"allowing":[68],"atomic":[69],"accesses":[70,82],"it.":[72],"However,":[73],"such":[74],"solutions":[75],"reduce":[77],"parallelism":[78],"serializing":[80],"all":[81,348],"that":[84,188,333],"location.":[85],"For":[86,328],"associative":[87],"commutative":[89],"updates":[90,105],"cell,":[94],"instead":[97],"use":[98],"reducer,":[100],"allows":[102],"race-free":[104],"expense":[108],"using":[110,265],"some":[111],"extra":[112,115,149,251],"space.":[113],"More":[114],"space":[116,150,172,240,252,299],"usually":[117],"leads":[118],"updates,":[122],"turn":[125],"contributes":[126],"potentially":[128],"lowering":[129],"overall":[131,183],"execution":[132],"time":[133,294,379],"program.":[136],"We":[137,186,218,231,278,301,363],"start":[138],"asking":[140],"following":[142],"question.":[143],"Given":[144],"fixed":[146],"budget":[147],"for":[151,357,369,381],"mitigating":[152],"cost":[154],"races":[156,193],"program,":[160],"locations":[163],"should":[164,170],"assigned":[166],"reducers":[167,177,243,274],"how":[169],"distributed":[174],"among":[175,242],"those":[176],"order":[179],"minimize":[181],"running":[184],"time?":[185],"argue":[187],"under":[189,347],"reasonable":[190],"conditions":[191],"captured":[199],"directed":[202],"acyclic":[203],"graph":[204],"(DAG),":[205],"nodes":[207],"representing":[208,213],"cells":[210],"arcs":[212],"read-write":[214],"dependencies":[215],"between":[216],"cells.":[217],"then":[219],"formulate":[220],"our":[221,303],"original":[222],"an":[225],"optimization":[226,361],"problem":[227,238,307,313,343,374],"on":[228,233],"this":[229,237],"DAG.":[230,327],"concentrate":[232],"variation":[235],"where":[239],"reuse":[241,321],"allowed":[245],"routing":[247],"every":[248],"unit":[249],"along":[253,275],"(possibly":[255,272],"different)":[256],"source":[257],"sink":[259],"path":[260],"DAG":[263,338],"it":[266],"construction":[269],"multiple":[271],"zero)":[273],"path.":[277],"consider":[279],"different":[281],"ways":[282],"constructing":[284],"reducer":[286],"corresponding":[289,360],"duration":[290,317,350],"functions":[291,318],"(i.e.,":[292],"reduction":[293],"function":[297],"budget).":[300],"generalize":[302],"race-avoiding":[304],"space-time":[305],"tradeoff":[306,312,373],"discrete":[310],"resource-time":[311,372],"general":[315,329,371],"non-increasing":[316],"resource":[320],"over":[322],"paths":[323],"given":[326],"DAGs,":[330],"we":[331,353],"show":[332],"even":[334],"entire":[337],"available":[340],"offline":[341],"strongly":[345],"NP-hard":[346],"three":[349],"functions,":[351],"give":[354,376],"approximation":[355,368],"algorithms":[356],"solving":[358],"problems.":[362],"also":[364],"prove":[365],"hardness":[366],"pseudo-polynomial":[378],"algorithm":[380],"series-parallel":[382],"DAGs.":[383]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2019-04-25T00:00:00"}