{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:23:02Z","timestamp":1755220982622,"version":"3.43.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Supercomputing"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1023\/a:1020937425960","type":"journal-article","created":{"date-parts":[[2003,3,20]],"date-time":"2003-03-20T19:19:47Z","timestamp":1048187987000},"page":"25-41","source":"Crossref","is-referenced-by-count":1,"title":["An Asynchronous Protocol for Release Consistent Distributed Shared Memory Systems"],"prefix":"10.1007","volume":"24","author":[{"given":"Jaeheung","family":"Yeo","sequence":"first","affiliation":[]},{"given":"Heon Y.","family":"Yeom","sequence":"additional","affiliation":[]},{"given":"Taesoon","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5101566_CR1","doi-asserted-by":"crossref","unstructured":"S. Adve, A. L. Cox, S. Dwarkadas, R. Rajamony, and W. Zwaenepoel. A comparison of entry consistency and lazy release consistency implementations. In Proc. 2nd High Performance Computer Architecture Conference, pp. 26\u201337, 1996.","DOI":"10.1109\/HPCA.1996.501171"},{"key":"5101566_CR2","doi-asserted-by":"crossref","unstructured":"S. V. Adve and K. Gharachorloo. Shared memory consistency models: A tutorial. Technical Report WRL-TR 95\/7, Digital Western Research Laboratory, 1995.","DOI":"10.21236\/ADA638015"},{"key":"5101566_CR3","doi-asserted-by":"crossref","unstructured":"S. V. Adve and M. D. Hill. Weak ordering-a new definition. In Proc. 17th Annual Int'l Symp. on Computer Architecture, pp. 2\u201314, 1990.","DOI":"10.1109\/ISCA.1990.134502"},{"key":"5101566_CR4","doi-asserted-by":"crossref","unstructured":"M. Ahamad, R. A. Bazzi, R. John, P. Kohli, and G. Neiger. The power of processor consistency. In Proc. 5th ACM Annual Symp. on Parallel Algorithms and Architectures, pp. 251\u2013260, 1993.","DOI":"10.1145\/165231.165264"},{"key":"5101566_CR5","doi-asserted-by":"crossref","unstructured":"B. N. Bershad. The Midway distributed shared memory system. In Proc. IEEE CompCon Conference, pp. 528\u2013537, 1993.","DOI":"10.1109\/CMPCON.1993.289730"},{"key":"5101566_CR6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0743-7315(92)90047-Q","volume":"15","author":"P. Bitar","year":"1992","unstructured":"P. Bitar. The weakest memory-access order. Journal of Parallel and Distributed Computing, 15:305\u2013331, 1992.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"5101566_CR7","doi-asserted-by":"crossref","unstructured":"J. B. Carter, J. K. Bennett, and W. Zwaenepoel. Implementation and performance of Munin. In Proc. 13th ACM Symp. Operating Systems Principles, pp. 152\u2013164, 1991.","DOI":"10.1145\/121132.121159"},{"key":"5101566_CR8","doi-asserted-by":"crossref","unstructured":"M. Dubois, C. Scheurich, and F. A. Briggs. Memory access buffering in multiprocessors. In Proc. 13th Annual Int'l Symp. on Computer Architecture, pp. 434\u2013442, 1986.","DOI":"10.1145\/17356.17406"},{"key":"5101566_CR9","doi-asserted-by":"crossref","unstructured":"K. Gharachorloo, D. E. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. L. Hennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In In Proc. 17th Annual Int'l Symp. on Computer Architecture, pp. 15\u201326, 1990.","DOI":"10.1109\/ISCA.1990.134503"},{"key":"5101566_CR10","doi-asserted-by":"crossref","unstructured":"J. R. Goodman and P. J. Woest. The wisconsin multicube: A new large-scale cache-coherent multiprocessor. In Proc. 15th Annual Int'l Symp. on Computer Architecture, pp. 422\u2013431, 1988.","DOI":"10.1109\/ISCA.1988.5253"},{"key":"5101566_CR11","doi-asserted-by":"crossref","unstructured":"P. W. Hutto and M. Ahamad. Slow memory: Weakening consistency to enhance concurrency in distributed shared memories. In Proc. 10th Int'l Conf. on Distributed Computing Systems, pp. 302\u2013311, 1990.","DOI":"10.1109\/ICDCS.1990.89297"},{"key":"5101566_CR12","doi-asserted-by":"crossref","unstructured":"L. Iftode, J. P. Singh, and K. Li. Scope consistency: A bridge between release consistency and entry consistency. In Proc. 8th ACM Annual Symp. on Parallel Algorithms and Architectures, pp. 277\u2013287, 1996.","DOI":"10.1145\/237502.237567"},{"key":"5101566_CR13","doi-asserted-by":"crossref","unstructured":"P. Keleher. Lazy release consistency for distributed shared memory. In Proc. 18th Annual Int'l Symp. on Computer Architecture, pp. 13\u201321, 1992.","DOI":"10.1109\/ISCA.1992.753300"},{"key":"5101566_CR14","doi-asserted-by":"crossref","unstructured":"P. Keleher, A. L. Cox, S. Dwarkadas, and W. Zwaenepoel. An evaluation of software-based release consistent protocols. Technical Report CS-TR-3543, University of Maryland, Computer Science Department, 1995.","DOI":"10.1006\/jpdc.1995.1113"},{"issue":"9","key":"5101566_CR15","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"C-28","author":"L. Lamport","year":"1979","unstructured":"L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690\u2013691, 1979.","journal-title":"IEEE Transactions on Computers"},{"key":"5101566_CR16","doi-asserted-by":"crossref","unstructured":"D. E. Lenoski, J. Laudon, K. Gharachorloo, A. Gupta, and J. L. Hennessy. The directory-based cache coherence protocol for the dash multiprocessor. In Proc. 17th Annual Int'l Symp. on Computer Architecture, pp. 148\u2013159, May 1990.","DOI":"10.1109\/ISCA.1990.134520"},{"issue":"3","key":"5101566_CR17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/2.121510","volume":"25","author":"D. E. Lenoski","year":"1992","unstructured":"D. E. Lenoski, J. Ludon, K. Gharachorloo, W. D. Weber, A. Gupta, J. L. Hennessy, M. Horowitz, and M. S. Lam. The stanford dash multiprocessor. IEEE Computer, 25(3):63\u201379, 1992.","journal-title":"IEEE Computer"},{"issue":"4","key":"5101566_CR18","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/75104.75105","volume":"7","author":"K. Li","year":"1989","unstructured":"K. Li and P. Hudak. Memory coherence in shared virtual memory systems. ACM Transactions on Computer Systems, 7(4):321\u2013359, 1989.","journal-title":"ACM Transactions on Computer Systems"},{"key":"5101566_CR19","doi-asserted-by":"crossref","unstructured":"B. H. Lim and R. Bianchini. Limits on the performance benefits of multithreading and prefetching. In Proc. Int'l Conf. on the Measurement and Modeling of Computer Systems, May 1996.","DOI":"10.1145\/233013.233021"},{"key":"5101566_CR20","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jpdc.1997.1332","volume":"43","author":"H. Lu","year":"1997","unstructured":"H. Lu, S. Dwarkadas, A. L. Cox, and W. Zwaenepoel. Quantifying the performance differences between pvm and treadmarks. Journal of Parallel and Distributed Computation, 43:65\u201378, 1997.","journal-title":"Journal of Parallel and Distributed Computation"},{"issue":"8","key":"5101566_CR21","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/2.84877","volume":"24","author":"B. Nitzberg","year":"1991","unstructured":"B. Nitzberg and V. Lo. Distributed shared memory: A survey of issues and algorithms. IEEE Computer, 24(8):52\u201360, 1991.","journal-title":"IEEE Computer"},{"key":"5101566_CR22","doi-asserted-by":"crossref","unstructured":"E. W. Parsons, M. Brorsson, and K. C. Sevcik. Predicting the performance of distributed virtual shared-memory applications. IBM Systems Journal, 36(4), 1997.","DOI":"10.1147\/sj.364.0527"},{"issue":"6","key":"5101566_CR23","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/2.55497","volume":"23","author":"P. Stenstrom","year":"1990","unstructured":"P. Stenstrom. A survey of cache coherence schemes for multiprocessors. IEEE Computer, 23(6):12\u201324, 1990.","journal-title":"IEEE Computer"},{"key":"5101566_CR24","doi-asserted-by":"crossref","unstructured":"K. Thitikamol and P. Keleher. Multi-threading and remote latency in software DSMs. In Proc. 17th Int'l Conf. on Distributed Computing Systems, pp. 296\u2013304, 1997.","DOI":"10.1109\/ICDCS.1997.598057"},{"key":"5101566_CR25","doi-asserted-by":"crossref","unstructured":"K. Thitikamol and P. Keleher. Per-node multi-threading and remote latency. IEEE Transactions on Computers, 1998.","DOI":"10.1109\/12.675711"},{"key":"5101566_CR26","unstructured":"J. E. Veenstra and R. Fowler. MINT tutorial and user manual. Rochester University, 1993."},{"key":"5101566_CR27","doi-asserted-by":"crossref","unstructured":"S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, A. Gupta. The SPLASH-2 programs: Characterization and methodological considerations. In Proc. 22nd Annual Int'l Symp. on Computer Architecture, 1995.","DOI":"10.1145\/223982.223990"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020937425960.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020937425960\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020937425960.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:49:31Z","timestamp":1754632171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020937425960"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["5101566"],"URL":"https:\/\/doi.org\/10.1023\/a:1020937425960","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}