{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:32Z","timestamp":1750307432730,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T00:00:00Z","timestamp":1284163200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,9,11]]},"DOI":"10.1145\/1854273.1854312","type":"proceedings-article","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T14:53:20Z","timestamp":1284476000000},"page":"295-306","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":38,"title":["Efficient sequential consistency using conditional fences"],"prefix":"10.1145","author":[{"given":"Changhui","family":"Lin","sequence":"first","affiliation":[{"name":"CSE Department, University of California, Riverside, CA, USA"}]},{"given":"Vijay","family":"Nagarajan","sequence":"additional","affiliation":[{"name":"School of Informatics, University of Edinburgh, Edinburgh, United Kingdom"}]},{"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[{"name":"CSE Department, University of California, Riverside, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,9,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.546611"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1669112.1669131"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555754.1555785"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250697"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2007.346189"},{"key":"e_1_3_2_1_6_1","first-page":"2","volume-title":"LCPC","author":"Chen W.-Y.","year":"2003","unstructured":"}} W.-Y. Chen , A. Krishnamurthy , and K. Yelick . Polynomial-time algorithms for enforcing sequential consistency in SPMD programs with arrays . In LCPC , pages 2 -- 4 . Springer-Verlag , 2003 . }}W.-Y. Chen, A. Krishnamurthy, and K. Yelick. Polynomial-time algorithms for enforcing sequential consistency in SPMD programs with arrays. In LCPC, pages 2--4. Springer-Verlag, 2003."},{"key":"e_1_3_2_1_7_1","first-page":"65","volume-title":"Cooperating sequential processes. The origin of concurrent programming: from semaphores to remote procedure calls","author":"Dijkstra E. W.","year":"2002","unstructured":"}} E. W. Dijkstra . Cooperating sequential processes. The origin of concurrent programming: from semaphores to remote procedure calls , pages 65 -- 138 , 2002 . }}E. W. Dijkstra. Cooperating sequential processes. The origin of concurrent programming: from semaphores to remote procedure calls, pages 65--138, 2002."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2009.29"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/782814.782854"},{"key":"e_1_3_2_1_10_1","first-page":"355","volume-title":"Proceedings of the 1991 International Conference on Parallel Processing","author":"Gharachorloo K.","year":"1991","unstructured":"}} K. Gharachorloo , A. Gupta , and J. Hennessy . Two techniques to enhance the performance of memory consistency models . In Proceedings of the 1991 International Conference on Parallel Processing , pages 355 -- 364 , 1991 . }}K. Gharachorloo, A. Gupta, and J. Hennessy. Two techniques to enhance the performance of memory consistency models. In Proceedings of the 1991 International Conference on Parallel Processing, pages 355--364, 1991."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645989.674317"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/300979.300993"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028176.1006711"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.43"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/207110.207142"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0136"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675439"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.947002"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1254810.1254836"},{"key":"e_1_3_2_1_20_1","first-page":"331","volume-title":"LCPC","author":"Midkiff S. P.","year":"1995","unstructured":"}} S. P. Midkiff . Dependence analysis in parallel loops with i\u00b1k subscripts . In LCPC , pages 331 -- 345 , 1995 . }}S. P. Midkiff. Dependence analysis in parallel loops with i\u00b1k subscripts. In LCPC, pages 331--345, 1995."},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the 1990 International Conference on Parallel Processing","volume":"113","author":"Midkiff S. P.","year":"1990","unstructured":"}} S. P. Midkiff and D. A. Padua . Issues in the optimization of parallel programs . In Proceedings of the 1990 International Conference on Parallel Processing , Volume 2: Software, pages 105-- 113 , Urbana-Champaign, IL, USA , 1990 . }}S. P. Midkiff and D. A. Padua. Issues in the optimization of parallel programs. In Proceedings of the 1990 International Conference on Parallel Processing, Volume 2: Software, pages 105--113, Urbana-Champaign, IL, USA, 1990."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/258492.258512"},{"key":"e_1_3_2_1_23_1","volume-title":"January","author":"Renau J.","year":"2005","unstructured":"}} J. Renau , B. Fraguela , J. Tuck , W. Liu , M. Prvulovic , L. Ceze , S. Sarangi , P. Sack , K. Strauss , and P. Montesinos . SESC simulator , January 2005 . http:\/\/sesc.sourceforge.net. }}J. Renau, B. Fraguela, J. Tuck, W. Liu, M. Prvulovic, L. Ceze, S. Sarangi, P. Sack, K. Strauss, and P. Montesinos. SESC simulator, January 2005. http:\/\/sesc.sourceforge.net."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/42190.42277"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065947"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250696"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/223982.223990"}],"event":{"name":"PACT '10: International Conference on Parallel Architectures and Compilation Techniques","sponsor":["IFIP WG 10.3 IFIP working group 10.3 on concurrent systems","IEEE CS TCPP IEEE-CS technical committee on parallel processing","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE CS TCAA IEEE CS technical committee on architectural acoustics"],"location":"Vienna Austria","acronym":"PACT '10"},"container-title":["Proceedings of the 19th international conference on Parallel architectures and compilation techniques"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1854273.1854312","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1854273.1854312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:56Z","timestamp":1750246796000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1854273.1854312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,11]]},"references-count":27,"alternative-id":["10.1145\/1854273.1854312","10.1145\/1854273"],"URL":"https:\/\/doi.org\/10.1145\/1854273.1854312","relation":{},"subject":[],"published":{"date-parts":[[2010,9,11]]},"assertion":[{"value":"2010-09-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}