{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:34Z","timestamp":1750220674227,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":93,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T00:00:00Z","timestamp":1623974400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["1908793, 1629915, 1629129, 1763681, 2028929, 2008398, 1931531"],"award-info":[{"award-number":["1908793, 1629915, 1629129, 1763681, 2028929, 2008398, 1931531"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,19]]},"DOI":"10.1145\/3453483.3454042","type":"proceedings-article","created":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T16:58:48Z","timestamp":1624553928000},"page":"252-267","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fluid: a framework for approximate concurrency via controlled dependency relaxation"],"prefix":"10.1145","author":[{"given":"Huaipan","family":"Jiang","sequence":"first","affiliation":[{"name":"Pennsylvania State University, USA"}]},{"given":"Haibo","family":"Zhang","sequence":"additional","affiliation":[{"name":"Pennsylvania State University, USA"}]},{"given":"Xulong","family":"Tang","sequence":"additional","affiliation":[{"name":"University of Pittsburgh, USA"}]},{"given":"Vineetha","family":"Govindaraj","sequence":"additional","affiliation":[{"name":"Pennsylvania State University, USA"}]},{"given":"Jack","family":"Sampson","sequence":"additional","affiliation":[{"name":"Pennsylvania State University, USA"}]},{"given":"Mahmut Taylan","family":"Kandemir","sequence":"additional","affiliation":[{"name":"Pennsylvania State University, USA"}]},{"given":"Danfeng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Pennsylvania State University, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814314"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/7929"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/83880.84528"},{"volume-title":"Compiling with continuations","author":"Appel Andrew W","key":"e_1_3_2_1_4_1","unstructured":"Andrew W Appel . 2007. Compiling with continuations . Cambridge University Press . Andrew W Appel. 2007. Compiling with continuations. Cambridge University Press."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806620"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.1998.694777"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009634810396"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3145812"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.2245"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/567806.567807"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/209937.209958"},{"key":"e_1_3_2_1_12_1","volume-title":"McKinley","author":"Bornholt James","year":"2014","unstructured":"James Bornholt , Todd Mytkowicz , and Kathryn S . McKinley . 2014 . Uncertain<T>: A First-Order Type for Uncertain Data. In ASPLOS. https:\/\/doi.org\/10.1145\/2541940.2541958 10.1145\/2541940.2541958 James Bornholt, Todd Mytkowicz, and Kathryn S. McKinley. 2014. Uncertain<T>: A First-Order Type for Uncertain Data. In ASPLOS. https:\/\/doi.org\/10.1145\/2541940.2541958"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2015.7054203"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2345156.2254086"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2544173.2509546"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2093157.2093165"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.303616"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cl.2016.01.002"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541329.2541336"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/279361.279378"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2824815.2824816"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-74183-3_1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3173162.3173181"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499370.2462184"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2012.48"},{"key":"e_1_3_2_1_27_1","volume-title":"A Faster Algorithm for Shortest-Path - SPFA","author":"Fanding Duan","year":"1994","unstructured":"Duan Fanding . 1994. A Faster Algorithm for Shortest-Path - SPFA . Journal of Southwest Jiaotong University , 2 ( 1994 ). Duan Fanding. 1994. A Faster Algorithm for Shortest-Path - SPFA. Journal of Southwest Jiaotong University, 2 (1994)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786833"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2019.00039"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPCW.2016.023"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3296979.3192400"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694351"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594306"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ETS.2013.6569370"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.1990.89297"},{"volume-title":"SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and&lt","author":"Iandola Forrest N","key":"e_1_3_2_1_36_1","unstructured":"Forrest N Iandola , Song Han , Matthew W Moskewicz , Khalid Ashraf , William J Dally , and Kurt Keutzer . 2016. SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and&lt ; 0.5 MB model size. arXiv preprint arXiv:1602.07360. Forrest N Iandola, Song Han, Matthew W Moskewicz, Khalid Ashraf, William J Dally, and Kurt Keutzer. 2016. SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and< 0.5 MB model size. arXiv preprint arXiv:1602.07360."},{"key":"e_1_3_2_1_37_1","unstructured":"Intel. 2020. Intel oneAPI Toolkits (Beta). https:\/\/software. intel.com\/content\/www\/us\/en\/developtools\/oneapi.html.  Intel. 2020. Intel oneAPI Toolkits (Beta). https:\/\/software. intel.com\/content\/www\/us\/en\/developtools\/oneapi.html."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC-SmartCity-DSS.2016.0168"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jcim.0c00542"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2001.903263"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993544"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3368826.3377924"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2909437.2909446"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMSCS.2017.2773488"},{"key":"e_1_3_2_1_45_1","volume-title":"Proc. CVPR Workshop on Fine-Grained Visual Categorization (FGVC). 2.","author":"Khosla Aditya","year":"2011","unstructured":"Aditya Khosla , Nityananda Jayadevaprakash , Bangpeng Yao , and Fei-Fei Li . 2011 . Novel dataset for fine-grained image categorization: Stanford dogs . In Proc. CVPR Workshop on Fine-Grained Visual Categorization (FGVC). 2. Aditya Khosla, Nityananda Jayadevaprakash, Bangpeng Yao, and Fei-Fei Li. 2011. Novel dataset for fine-grained image categorization: Stanford dogs. In Proc. CVPR Workshop on Fine-Grained Visual Categorization (FGVC). 2."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2212908.2212951"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.1998.694785"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOSE.2007.19"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1535\/itj.1104.05"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/VLSID.2011.51"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908080.2908087"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/125826.105186"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/2667473.2667476"},{"volume-title":"5th $USENIX$ Workshop on Hot Topics in Parallelism (HotPar 13).","author":"Lin Tsung-Han","key":"e_1_3_2_1_55_1","unstructured":"Tsung-Han Lin , Stephen J Tarsa , and HT Kung . 2013. Parallelization primitives for dynamic sparse computations . In 5th $USENIX$ Workshop on Hot Topics in Parallelism (HotPar 13). Tsung-Han Lin, Stephen J Tarsa, and HT Kung. 2013. Parallelization primitives for dynamic sparse computations. In 5th $USENIX$ Workshop on Hot Topics in Parallelism (HotPar 13)."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu080"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2016.7783746"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2014.22"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2714064.2660231"},{"key":"e_1_3_2_1_61_1","unstructured":"Sasa Misailovic Deokhwan Kim and Martin Rinard. 2010. Automatic parallelization with statistical accuracy bounds. MIT CSAIL\/EECS.  Sasa Misailovic Deokhwan Kim and Martin Rinard. 2010. Automatic parallelization with statistical accuracy bounds. MIT CSAIL\/EECS."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2414729.2414738"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2017.7863739"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.1999.809455"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/143365.143490"},{"key":"e_1_3_2_1_66_1","volume-title":"NIPS 2017 Autodiff Workshop.","author":"Paszke Adam","year":"2017","unstructured":"Adam Paszke , Sam Gross , Soumith Chintala , Gregory Chanan , Edward Yang , Zachary DeVito , Zeming Lin , Alban Desmaison , Luca Antiga , and Adam Lerer . 2017 . Automatic differentiation in PyTorch . NIPS 2017 Autodiff Workshop. Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. 2017. Automatic differentiation in PyTorch. NIPS 2017 Autodiff Workshop."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3135974.3135989"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380210503"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2414729.2414737"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2654822.2541971"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297027.1297055"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASWEC.2013.19"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594294"},{"volume-title":"An efficient shared memory layer for distributed memory machines. Computer Systems Laboratory","author":"Scales Daniel J","key":"e_1_3_2_1_75_1","unstructured":"Daniel J Scales and Monica S Lam . 1994. An efficient shared memory layer for distributed memory machines. Computer Systems Laboratory , Stanford University . Daniel J Scales and Monica S Lam. 1994. An efficient shared memory layer for distributed memory machines. Computer Systems Laboratory, Stanford University."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210658"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360612"},{"key":"e_1_3_2_1_78_1","volume-title":"Proceedings of the symposium on information networks. 119\u2013203","author":"Shimbel Alfonso","year":"1954","unstructured":"Alfonso Shimbel . 1954 . Structure in communication nets . In Proceedings of the symposium on information networks. 119\u2013203 . Alfonso Shimbel. 1954. Structure in communication nets. In Proceedings of the symposium on information networks. 119\u2013203."},{"key":"e_1_3_2_1_79_1","unstructured":"Karen Simonyan and Andrew Zisserman. 2014. Very deep convolutional networks for large-scale image recognition. arXiv.  Karen Simonyan and Andrew Zisserman. 2014. Very deep convolutional networks for large-scale image recognition. arXiv."},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2006.1598113"},{"key":"e_1_3_2_1_81_1","volume-title":"Workshop on Approximate Computing Across the Stack.","author":"Sutherland Mark","year":"2015","unstructured":"Mark Sutherland , Joshua San Miguel , and Natalie Enright Jerger . 2015 . Texture cache approximation on GPUs . In Workshop on Approximate Computing Across the Stack. Mark Sutherland, Joshua San Miguel, and Natalie Enright Jerger. 2015. Texture cache approximation on GPUs. In Workshop on Approximate Computing Across the Stack."},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2017.14"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/2628071.2628110"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993555"},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.1995.476841"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2016.7783745"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/2540708.2540710"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.7873\/DATE.2013.280"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1021\/jm048957q"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2016.2630270"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/2836168"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/146628.139709"},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci8001167"},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/960112.28722"},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103621.2103710"}],"event":{"name":"PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Virtual Canada","acronym":"PLDI '21"},"container-title":["Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453483.3454042","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3453483.3454042","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3453483.3454042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:03:07Z","timestamp":1750197787000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453483.3454042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,18]]},"references-count":93,"alternative-id":["10.1145\/3453483.3454042","10.1145\/3453483"],"URL":"https:\/\/doi.org\/10.1145\/3453483.3454042","relation":{},"subject":[],"published":{"date-parts":[[2021,6,18]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}