{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:45:58Z","timestamp":1742399158486},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201847"},{"type":"electronic","value":"9783540399896"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39989-6_8","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T21:01:57Z","timestamp":1294434117000},"page":"106-120","source":"Crossref","is-referenced-by-count":14,"title":["Multi-writer Consistency Conditions for Shared Memory Objects"],"prefix":"10.1007","author":[{"given":"Cheng","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evelyn","family":"Pierce","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer L.","family":"Welch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Ahamad, M., Bazzi, R., John, R., Kohli, P., Neiger, G.: The Power of Processor Consistency. In: ACM Symposium on Parallel Algorithms and Architectures, pp. 251\u2013260 (1993)","DOI":"10.1145\/165231.165264"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1996","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing Memory Robustly in Message Passing Systems. Journal of the ACM\u00a042(1), 124\u2013142 (1996)","journal-title":"Journal of the ACM"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Attiya, H., Friedman, R.: A Correctness Condition for High Performance Multiprocessors. In: Proceedings of the 24th ACM Symposium on Theory of Computing, pp. 679\u2013690 (1992)","DOI":"10.1145\/129712.129778"},{"key":"8_CR4","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H. Attiya","year":"1998","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, New York (1998)"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s004460050004","volume":"13","author":"R.A. Bazzi","year":"2000","unstructured":"Bazzi, R.A.: Synchronous Byzantine Quorum Systems. Distributed Computing\u00a013(1), 45\u201352 (2000)","journal-title":"Distributed Computing"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"key":"8_CR7","unstructured":"Goodman, J.: Cache Consistency and Sequential Consistency. Technical Report 61, IEEE Scalable Coherent Interface Working Group (1989)"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.: Linearizability: A Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Higham, L., Kawash, J.: Bounds for Mutual Exclusion with Only Processor Consistency. In: Proceedings of the 14th International Symposium on Distributed Computing, pp. 44\u201358 (2000)","DOI":"10.1007\/3-540-40026-5_3"},{"issue":"9","key":"8_CR10","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"C-28","author":"L. Lamport","year":"1979","unstructured":"Lamport, L.: How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs. IEEE Transactions on Computers\u00a0C-28(9), 690\u2013691 (1979)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On Interprocessor Communication. Part I and II. Distributed Computing\u00a01(2), 77\u2013101 (1986)","journal-title":"Distributed Computing"},{"key":"8_CR12","unstructured":"Lipton, R., Sandberg, J.: PRAM: A Scalable Shared Memory. Technical Report 180-88, Department of Computer Science, Princeton University (1988)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Lynch, N., Shvartsman, A.: RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. In: Proceedings of the 16th International Symposium on Distributed Computing (2002)","DOI":"10.1007\/3-540-36108-1_12"},{"key":"8_CR14","unstructured":"Lee, H., Welch, J.: Applications of Probabilistic Quorums to Iterative Algorithms. In: Proceedings ofthe 21st International Conference on Distributed Computing Systems, pp. 21\u201330 (2001)"},{"issue":"4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D. Malkhi","year":"1998","unstructured":"Malkhi, D., Reiter, M.: Byzantine Quorum Systems. Distributed Computing\u00a011(4), 203\u2013213 (1998)","journal-title":"Distributed Computing"},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/inco.2001.3054","volume":"170","author":"D. Malkhi","year":"2001","unstructured":"Malkhi, D., Reiter, M., Wool, A., Wright, R.: Probabilistic Quorum Systems. Information and Computation\u00a0170(2), 184\u2013206 (2001)","journal-title":"Information and Computation"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"G.L. Peterson","year":"1981","unstructured":"Peterson, G.L.: Myths about the Mutual Exclusion Problem. Information Processing Letters\u00a012(3), 115\u2013116 (1981)","journal-title":"Information Processing Letters"},{"key":"8_CR18","volume-title":"Algorithms for Mutual Exclusion","author":"M. Raynal","year":"1986","unstructured":"Raynal, M.: Algorithms for Mutual Exclusion. The MIT Press, Cambridge (1986)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Shao, C., Pierce, E., Welch, J.: Multi-Writer Consistency Conditions for Shared Memory Objects. Technical Report 2003-7-1, Department of Computer Science, Texas A&M University (July 2003)","DOI":"10.1007\/978-3-540-39989-6_8"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39989-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T14:03:05Z","timestamp":1559916185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39989-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201847","9783540399896"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39989-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}