{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:22:49Z","timestamp":1777965769318,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1439084, CNS-1553510, IIS-1546113, CCF-1526406"],"award-info":[{"award-number":["CCF-1439084, CNS-1553510, IIS-1546113, CCF-1526406"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"United States-Israel Binational Science Foundation","award":["2016116"],"award-info":[{"award-number":["2016116"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3323165.3323209","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"359-368","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths"],"prefix":"10.1145","author":[{"given":"Rathish","family":"Das","sequence":"first","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shih-Yu","family":"Tsai","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharmila","family":"Duppala","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayson","family":"Lynch","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esther M.","family":"Arkin","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rezaul","family":"Chowdhury","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Skiena","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814294"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.04.006"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/378995.379232"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646664.700618"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0107"},{"key":"e_1_3_2_1_6_1","unstructured":"OpenMP Architecture Review Board. 1997. OpenMP: A proposed industry standard API for shared memory programming. White Paper (1997). http:\/\/www.openmp.org\/specs\/mp-documents\/paper\/paper.ps.  OpenMP Architecture Review Board. 1997. OpenMP: A proposed industry standard API for shared memory programming. White Paper (1997). http:\/\/www.openmp.org\/specs\/mp-documents\/paper\/paper.ps."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/99.660313"},{"key":"e_1_3_2_1_8_1","volume-title":"Data races and the discrete resource-time tradeoff problem with resource reuse over paths. arXiv preprint arXiv:1904.09283","author":"Das Rathish","year":"2019","unstructured":"Rathish Das , Shih-Yu Tsai , Sharmila Duppala , Jayson Lynch , Esther M. Arkin , Rezaul Chowdhury , Joseph S. B. Mitchell , and Steven Skiena . 2019. Data races and the discrete resource-time tradeoff problem with resource reuse over paths. arXiv preprint arXiv:1904.09283 ( 2019 ). Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M. Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, and Steven Skiena. 2019. Data races and the discrete resource-time tradeoff problem with resource reuse over paths. arXiv preprint arXiv:1904.09283 (2019)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.2.302"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0402042"},{"key":"e_1_3_2_1_11_1","unstructured":"Pierre-Francc ois Dutot Gr\u00e9gory Mouni\u00e9 and Denis Trystram. 2004. Scheduling parallel tasks: Approximation algorithms.  Pierre-Francc ois Dutot Gr\u00e9gory Mouni\u00e9 and Denis Trystram. 2004. Scheduling parallel tasks: Approximation algorithms."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000120"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Matteo Frigo Pablo Halpern Charles E. Leiserson and Stephen Lewin-Berlin. 2009. Reducers and other Cilk  Matteo Frigo Pablo Halpern Charles E. Leiserson and Stephen Lewin-Berlin. 2009. Reducers and other Cilk","DOI":"10.1145\/1583991.1584017"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM, 79--90","unstructured":"hyperobjects. In Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM, 79--90 . hyperobjects. In Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM, 79--90."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/277652.277725"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.7.2.167"},{"key":"e_1_3_2_1_17_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S . Johnson . 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness .W. H. Freeman & Co. , NY, USA. Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness .W. H. Freeman & Co., NY, USA."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2480359.2429109"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159892.1159899"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.3.296"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460299.1460318"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.22"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00264-3"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054102001308"},{"key":"e_1_3_2_1_25_1","volume-title":"Algorithms and Order","author":"M\u00f6hring Rolf H.","unstructured":"Rolf H. M\u00f6hring . 1989. Computationally tractable classes of ordered sets . In Algorithms and Order . Springer , 105--193. Rolf H. M\u00f6hring. 1989. Computationally tractable classes of ordered sets. In Algorithms and Order. Springer, 105--193."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/130616.130623"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.1977.11731665"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.24.4.393"},{"key":"e_1_3_2_1_29_1","volume-title":"Intel Threading Building Blocks: outfitting C+ for multi-core processor parallelism","author":"Reinders James","unstructured":"James Reinders . 2007. Intel Threading Building Blocks: outfitting C+ for multi-core processor parallelism . O'Reilly Media, Inc. James Reinders. 2007. Intel Threading Building Blocks: outfitting C+ for multi-core processor parallelism .O'Reilly Media, Inc."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.22.2.158"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133956.1133968"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1897852.1897873"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/2804694.2804701"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/140901.141909"}],"event":{"name":"SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures","location":"Phoenix AZ USA","acronym":"SPAA '19","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["The 31st ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323209","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323209","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323209","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:16Z","timestamp":1750202596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":35,"alternative-id":["10.1145\/3323165.3323209","10.1145\/3323165"],"URL":"https:\/\/doi.org\/10.1145\/3323165.3323209","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}