{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:59:51Z","timestamp":1725487191406},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414292"},{"type":"electronic","value":"9783540444671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44467-x_32","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:21:46Z","timestamp":1184588506000},"page":"355-366","source":"Crossref","is-referenced-by-count":5,"title":["Memory Consistency and Process Coordination for SPARC Multiprocessors"],"prefix":"10.1007","author":[{"given":"Lisa","family":"Higham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jalal","family":"Kawash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,8]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01784241","volume":"9","author":"M. Ahamad","year":"1995","unstructured":"M. Ahamad, G. Neiger, J. E. Burns, P. Kohli, and P. W. Hutto. Causal memory: Definitions, implementations, and programming. Distributed Computing, 9:37\u201349, 1995.","journal-title":"Distributed Computing"},{"key":"32_CR2","series-title":"Technical Report","volume-title":"Cooperating sequential processes","author":"E. W. Dijkstra","year":"1965","unstructured":"E. W. Dijkstra. Cooperating sequential processes. Technical Report EWD-123, Technological University, Eindhoven, the Netherlands, 1965. Reprinted in [4]."},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"M. Dubois, C. Scheurich, and F. Briggs. Memory access buffering in multiprocessors. In Proc. 13th Int\u2019l Symp. on Computer Architecture, pages 434\u2013442, June 1986.","DOI":"10.1145\/17356.17406"},{"key":"32_CR4","unstructured":"F. Genuys, editor. Programming Languages. Academic Press, 1968."},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"A. Gontmakher and A. Schuster. Characterizations of Java memory behavior. In Proc. 12th Int\u2019l Parallel Processing Symp., April 1998.","DOI":"10.1109\/IPPS.1998.670000"},{"key":"32_CR6","unstructured":"J. Goodman. Cache consistency and sequential consistency. Technical Report 61, IEEE Scalable Coherent Interface Working Group, March 1989."},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"L. Higham and J. Kawash. Java: Memory consistency and process coordination (extended abstract). In Proc. 12th Int\u2019l Symp. on Distributed Computing, pages 201\u2013215, September 1998.","DOI":"10.1007\/BFb0056484"},{"key":"32_CR8","unstructured":"L. Higham and J. Kawash. Specifications for the SPARC version 9 memory consistency models. Technical report, Department of Computer Science, The University of Calgary, 2000."},{"key":"32_CR9","unstructured":"J. Kawash. Limitations and Capabilities of Weak Memory Consistency Systems. Ph.D. dissertation, Department of Computer Science, The University of Calgary, January 2000."},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"J. Kawash and L. Higham. Memory consistency and process coordination for SPARC v8 multiprocessors. Technical Report 99\/646\/09, Department of Computer Science, The University of Calgary, December 1999. A brief announcement appeared in Proc. 19th ACM Symp. on Principles of Distributed Computing, page 335, July 2000.","DOI":"10.1145\/343477.362115"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"P. Kohli, G. Neiger, and M. Ahamad. A characterization of scalable shared memories. In Proc. 1993 Int\u2019l Conf. on Parallel Processing, August 1993.","DOI":"10.1109\/ICPP.1993.15"},{"issue":"9","key":"32_CR12","doi-asserted-by":"publisher","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 Trans. on Computers, C-28(9):690\u2013691, September 1979.","journal-title":"IEEE Trans. on Computers"},{"key":"32_CR13","unstructured":"R. J. Lipton and J. S. Sandberg. PRAM: A scalable shared memory. Technical Report 180-88, Department of Computer Science, Princeton University, September 1988."},{"issue":"2","key":"32_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1109\/12.752664","volume":"48","author":"S. Park","year":"1999","unstructured":"S. Park and D. L. Dill. An executable specification and verifier for relaxed memory order. IEEE Trans. on Computers, 48(2):227\u2013235, February 1999.","journal-title":"IEEE Trans. on Computers"},{"key":"32_CR15","unstructured":"M. Raynal. Algorithms for Mutual Exclusion. The MIT Press, 1986."},{"key":"32_CR16","unstructured":"SPARC International, Inc. The SPARC Architecture Manual version 8. Prentice-Hall, 1992."},{"key":"32_CR17","unstructured":"D. L. Weaver and T. Germond, editors. The SPARC Architecture Manual version 9. Prentice-Hall, 1994."}],"container-title":["Lecture Notes in Computer Science","High Performance Computing \u2014 HiPC 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44467-X_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:31:43Z","timestamp":1556667103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44467-X_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414292","9783540444671"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44467-x_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}