{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T05:22:42Z","timestamp":1741324962610,"version":"3.38.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T00:00:00Z","timestamp":1309219200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s10766-011-0176-3","type":"journal-article","created":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T00:26:40Z","timestamp":1309220800000},"page":"84-117","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Sequential Consistency Using Conditional Fences"],"prefix":"10.1007","volume":"40","author":[{"given":"Changhui","family":"Lin","sequence":"first","affiliation":[]},{"given":"Vijay","family":"Nagarajan","sequence":"additional","affiliation":[]},{"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,28]]},"reference":[{"issue":"8","key":"176_CR1","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/1787234.1787255","volume":"53","author":"S.V. Adve","year":"2010","unstructured":"Adve S.V., Boehm H.-J.: Memory models: a case for rethinking parallel languages and hardware. Commun. ACM 53(8), 90\u2013101 (2010)","journal-title":"Commun. ACM"},{"key":"176_CR2","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/2.546611","volume":"29","author":"S.V. Adve","year":"1995","unstructured":"Adve S.V., Gharachorloo K.: Shared memory consistency models: a tutorial. IEEE Comput. 29, 66\u201376 (1995)","journal-title":"IEEE Comput."},{"key":"176_CR3","doi-asserted-by":"crossref","unstructured":"Adve, S.V., Hill, M.D.: Weak ordering\u2014a new definition. In: Proceedings of the 17th Annual International Symposium on Computer Architecture, ISCA \u201990, pp. 2\u201314. ACM, New York (1990)","DOI":"10.1145\/325164.325100"},{"key":"176_CR4","doi-asserted-by":"crossref","unstructured":"Ahn, W., Qi, S., Nicolaides, M., Torrellas, J., Lee, J.-W., Fang, X., Midkiff, S., Wong, D.: BulkCompiler: high-performance sequential consistency through cooperative compiler and hardware support. In: Proceedings of MICRO-42, pp. 133\u2013144. ACM, New York (2009)","DOI":"10.1145\/1669112.1669131"},{"key":"176_CR5","unstructured":"Asanovic, K., Bodik, R., Catanzaro, B.C., Gebis, J.J., Husbands, P., Keutzer, K., Patterson, D.A., Plishker, W.L., Shalf, J., Williams, S.W., Yelick, K.A.: The landscape of parallel computing research: a view from Berkeley. Technical report, EECS Department, University of California, Berkeley (Dec 2006)"},{"key":"176_CR6","doi-asserted-by":"crossref","unstructured":"Blundell, C., Martin, M.M., Wenisch, T.F.: Invisifence: performance-transparent memory ordering in conventional multiprocessors. In: Proceedings of ISCA-36, pp. 233\u2013244. ACM, New York (2009)","DOI":"10.1145\/1555754.1555785"},{"key":"176_CR7","doi-asserted-by":"crossref","unstructured":"Ceze, L., Tuck, J., Montesinos, P., Torrellas, J.: BulkSC: Bulk enforcement of sequential consistency. In: Proceedings of ISCA-34, pp. 278\u2013289 (2007)","DOI":"10.1145\/1250662.1250697"},{"key":"176_CR8","doi-asserted-by":"crossref","unstructured":"Chafi, H., Casper, J., Carlstrom, B.D., McDonald, A., Minh, C.C., Baek, W., Kozyrakis, C., Olukotun K.: A scalable, non-blocking approach to transactional memory. In: HPCA-13, pp. 97\u2013108. IEEE Computer Society, Washington, DC (2007)","DOI":"10.1109\/HPCA.2007.346189"},{"key":"176_CR9","doi-asserted-by":"crossref","unstructured":"Chen, W.-Y., Krishnamurthy, A., Yelick, K.A.: Polynomial-time algorithms for enforcing sequential consistency in SPMD programs with arrays. In: LCPC, pp. 340\u2013356. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-24644-2_22"},{"key":"176_CR10","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: Cooperating Sequential Processes. The Origin of Concurrent Programming: From Semaphores to Remote Procedure Calls, pp. 65\u2013138, (2002)","DOI":"10.1007\/978-1-4757-3472-0_2"},{"key":"176_CR11","doi-asserted-by":"crossref","unstructured":"Duan, Y., Feng, X., Wang, L., Zhang, C., Yew, P.-C.: Detecting and eliminating potential violations of sequential consistency for concurrent C\/C\u00a0+\u00a0\u00a0+ programs. In: CGO \u201909, pp. 25\u201334. IEEE Computer Society, Washington, DC (2009)","DOI":"10.1109\/CGO.2009.29"},{"key":"176_CR12","doi-asserted-by":"crossref","unstructured":"Fang, X., Lee, J., Midkiff, S.P.: Automatic fence insertion for shared memory multiprocessing. In: ICS \u201903: Proceedings of the 17th Annual International Conference on Supercomputing, pp. 285\u2013294. ACM, New York (2003)","DOI":"10.1145\/782852.782854"},{"key":"176_CR13","unstructured":"Gharachorloo, K., Gupta, A., Hennessy, J.: Two techniques to enhance the performance of memory consistency models. In: Proceedings of the 1991 International Conference on Parallel Processing, pp. 355\u2013364 (1991)"},{"key":"176_CR14","doi-asserted-by":"crossref","unstructured":"Gniady, C., Falsafi, B.: Speculative sequential consistency with little custom storage. In: PACT \u201902: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques, pp. 179\u2013188. IEEE Computer Society, Washington, DC (2002)","DOI":"10.1109\/PACT.2002.1106016"},{"key":"176_CR15","doi-asserted-by":"crossref","unstructured":"Gniady, C., Falsafi, B., Vijaykumar, T.N.: Is SC +ILP = RC? In: Proceedings of ISCA-26, pp. 162\u2013171. IEEE Computer Society, Washington, DC (1999)","DOI":"10.1145\/307338.300993"},{"issue":"2","key":"176_CR16","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/1028176.1006711","volume":"32","author":"L. Hammond","year":"2004","unstructured":"Hammond L., Wong V., Chen M., Carlstrom B.D., Davis J.D., Hertzberg B., Prabhu M.K., Wijaya H., Kozyrakis C., Olukotun K.: Transactional memory coherence and consistency. SIGARCH Comput. Archit. News 32(2), 102 (2004)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"176_CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/MC.2008.209","volume":"41","author":"M.D. Hill","year":"2008","unstructured":"Hill M.D., Marty M.R.: Amdahl\u2019s law in the multicore era. Computer 41, 33\u201338 (2008)","journal-title":"Computer"},{"key":"176_CR18","doi-asserted-by":"crossref","unstructured":"Kamil, A., Su, J., Yelick, K.: Making sequential consistency practical in Titanium. In: SC \u201905: Proceedings of the 2005 ACM\/IEEE Conference on Supercomputing, pp. 15. IEEE Computer Society, Washington, DC (2005)","DOI":"10.1109\/SC.2005.43"},{"key":"176_CR19","doi-asserted-by":"crossref","unstructured":"Krishnamurthy, A., Yelick, K.: Optimizing parallel programs with explicit synchronization. In: Proceedings of the ACM SIGPLAN \u201995 Conference on Programming Language Design and Implementation, pp. 196\u2013204 (1995)","DOI":"10.1145\/223428.207142"},{"key":"176_CR20","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1006\/jpdc.1996.0136","volume":"38","author":"A. Krishnamurthy","year":"1996","unstructured":"Krishnamurthy A., Yelick K.: Analyses and optimizations for shared address space programs. J. Parallel Distrib. Comput 38, 130\u2013144 (1996)","journal-title":"J. Parallel Distrib. Comput"},{"issue":"9","key":"176_CR21","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L. Lamport","year":"1979","unstructured":"Lamport L.: How to make a multiprocessor computer that correctly executes multiprocess progranm. IEEE Trans. Comput. 28(9), 690\u2013691 (1979)","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"176_CR22","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1109\/12.947002","volume":"50","author":"J. Lee","year":"2001","unstructured":"Lee J., Padua D.A.: Hiding relaxed memory consistency with a compiler. IEEE Trans. Comput. 50(8), 824\u2013833 (2001)","journal-title":"IEEE Trans. Comput."},{"key":"176_CR23","doi-asserted-by":"crossref","unstructured":"Lee, K., Fang, X., Midkiff, S.P.: Practical escape analyses: how good are they? In: VEE \u201907: Proceedings of the 3rd International Conference on Virtual Execution Environments, pp. 180\u2013190. ACM, New York (2007)","DOI":"10.1145\/1254810.1254836"},{"key":"176_CR24","doi-asserted-by":"crossref","unstructured":"Liao, G., Guo, D., Bhuyan, L., King, S.R.: Software techniques to improve virtualized I\/O performance on multi-core systems. In: Proceedings of the 4th ANCS, pp. 161\u2013170. ACM, New York (2008)","DOI":"10.1145\/1477942.1477971"},{"key":"176_CR25","doi-asserted-by":"crossref","unstructured":"Liao, G., Zhu, X., Bhuyan, L.: A new server I\/O architecture for high speed networks. In: Proceedings of the 17th IEEE International Symposium on High-Performance Computer Architecture, HPCA \u201911 (2011)","DOI":"10.1109\/HPCA.2011.5749734"},{"key":"176_CR26","doi-asserted-by":"crossref","unstructured":"Lucia, B., Ceze, L., Strauss, K., Qadeer, S., Boehm, H.-J.: Conflict exceptions: simplifying concurrent language semantics with precise hardware exceptions for data-races. In: Proceedings of ISCA \u201937, pp. 210\u2013221. ACM, New York (2010)","DOI":"10.1145\/1815961.1815987"},{"key":"176_CR27","doi-asserted-by":"crossref","unstructured":"Marino, D., Singh, A., Millstein, T., Musuvathi, M., Narayanasamy, S.: DRFx: a simple and efficient memory model for concurrent programming languages. In: Proceedings of PLDI \u201910, pp. 351\u2013362. ACM, New York (2010)","DOI":"10.1145\/1806596.1806636"},{"key":"176_CR28","doi-asserted-by":"crossref","unstructured":"Midkiff, S.P.: Dependence analysis in parallel loops with i \u00b1 k subscripts. In: LCPC, pp. 331\u2013345 (1995)","DOI":"10.1007\/BFb0014209"},{"key":"176_CR29","unstructured":"Midkiff, S.P., Padua, D.A.: Issues in the optimization of parallel programs. In: Proceedings of the 1990 International Conference on Parallel Processing, Vol. 2: Software, pp. 105\u2013113. Urbana-Champaign, IL (1990)"},{"key":"176_CR30","doi-asserted-by":"crossref","unstructured":"Ranganathan, P., Pai, V.S., Adve, S.V.: Using speculative retirement and larger instruction windows to narrow the performance gap between memory consistency models. In: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 199\u2013210. ACM, New York (1997)","DOI":"10.1145\/258492.258512"},{"key":"176_CR31","unstructured":"Renau, J., Fraguela, B., Tuck, J., Liu, W., Prvulovic, M., Ceze, L., Sarangi, S., Sack, P., Strauss, K., Montesinos, P.: SESC simulator, (January 2005). http:\/\/sesc.sourceforge.net"},{"issue":"2","key":"176_CR32","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1145\/42190.42277","volume":"10","author":"D. Shasha","year":"1988","unstructured":"Shasha D., Snir M.: Efficient and correct execution of parallel programs that share memory. ACM Trans. Program. Lang. Syst. 10(2), 282\u2013312 (1988)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"176_CR33","doi-asserted-by":"crossref","unstructured":"Singh, A., Marino, D., Narayanasamy, S., Millstein, T., Musuvathi, M.: Efficient processor support for DRFx, a memory model with exceptions. In: Proceedings of the Sixteenth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS \u201911, pp. 53\u201366. ACM, New York (2011)","DOI":"10.1145\/1950365.1950375"},{"key":"176_CR34","doi-asserted-by":"crossref","unstructured":"Sura, Z., Fang, X., Wong, C.-L., Midkiff, S.P., Lee, J., Padua, D.: Compiler techniques for high performance sequentially consistent Java programs. In: PPoPP \u201905, pp. 2\u201313. ACM, New York (2005)","DOI":"10.1145\/1065944.1065947"},{"key":"176_CR35","unstructured":"Sutter, H.: The free lunch is over: a fundamental turn toward concurrency in software. (2005). http:\/\/www.gotw.ca\/publications\/concurrency-ddj.htm , March 2005"},{"key":"176_CR36","doi-asserted-by":"crossref","unstructured":"Tian, C., Feng, M., Nagarajan, V., Gupta, R.: Copy or discard execution model for speculative parallelization on multicores. In: Proceedings of Micro-41, pp. 330\u2013341. IEEE Computer Society, Washington, DC (2008)","DOI":"10.1109\/MICRO.2008.4771802"},{"key":"176_CR37","doi-asserted-by":"crossref","unstructured":"von Praun, C., Cain, H.W., Choi, J.-D., Ryu, K.D.: Conditional memory ordering. In: Proceedings of the 33rd Annual International Symposium on Computer Architecture, ISCA \u201906, pp. 41\u201352. IEEE Computer Society, Washington, DC (2006)","DOI":"10.1145\/1150019.1136490"},{"key":"176_CR38","doi-asserted-by":"crossref","unstructured":"Wenisch, T.F., Ailamaki, A., Falsafi, B., Moshovos, A.: Mechanisms for store-wait-free multiprocessors. In: Proceedings of ISCA-34, pp. 266\u2013277. ACM, New York (2007)","DOI":"10.1145\/1250662.1250696"},{"key":"176_CR39","doi-asserted-by":"crossref","unstructured":"Woo, S.C., Ohara, M., Torrie, E., Singh, J.P., Gupta, A.: The SPLASH-2 programs: characterization and methodological considerations. In: Proceedings of ISCA-22, pp. 24\u201336. ACM, New York (1995)","DOI":"10.1145\/225830.223990"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-011-0176-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-011-0176-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-011-0176-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T19:25:19Z","timestamp":1741289119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-011-0176-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,28]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["176"],"URL":"https:\/\/doi.org\/10.1007\/s10766-011-0176-3","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2011,6,28]]}}}