{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:04:52Z","timestamp":1763467492676},"reference-count":54,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5160,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0304-3975(98)90244-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"267-319","source":"Crossref","is-referenced-by-count":9,"title":["Linearizable read\/write objects"],"prefix":"10.1016","volume":"220","author":[{"given":"Marios","family":"Mavronicolas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Roth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0304-3975(98)90244-4_BIB1","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1109\/71.242161","article-title":"A unified formalization of four shared-memory models","volume":"4","author":"Adve","year":"1993","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"issue":"12","key":"10.1016\/S0304-3975(98)90244-4_BIB2","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/2.546611","article-title":"Shared memory consistency models: a tutorial","volume":"29","author":"Adve","year":"1996","journal-title":"Computer"},{"issue":"4","key":"10.1016\/S0304-3975(98)90244-4_BIB3","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/153724.153741","article-title":"Atomic snapshots of shared memory","volume":"40","author":"Afek","year":"1993","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0304-3975(98)90244-4_BIB4","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1145\/151646.151651","article-title":"Lazy caching","volume":"15","author":"Afek","year":"1993","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB5","series-title":"Proc. 13th Annu. ACM Symp. on Principles of Distributed Computing","first-page":"101","article-title":"Mixed consistency: a model for parallel programming","author":"Agrawal","year":"1994"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB6","series-title":"Proc. 5th Annu. ACM Symp. on Parallel Algorithms and Architectures","first-page":"251","article-title":"The power of processor consistency","author":"Ahamad","year":"1993"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01784241","article-title":"Causal memory","volume":"9","author":"Ahamad","year":"1995","journal-title":"Distrib. Comput."},{"key":"10.1016\/S0304-3975(98)90244-4_BIB8","series-title":"Proc. 11th Internat. Conf. on Distributed Computing Systems","first-page":"274","article-title":"Implementing and programming causal distributed shared memory","author":"Ahamad","year":"1991"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB9","series-title":"Proc. 11th Annual IEEE Symp. on Logic in Computer Science","first-page":"219","article-title":"Model-checking of correctness conditions for concurrent objects","author":"Alur","year":"1996"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB10","series-title":"Proc. 5th Internat. Workshop on Distributed Algorithms (WDAG'91)","first-page":"80","article-title":"Implementing FIFO queues and stacks","volume":"vol. 579","author":"Attiya","year":"1991"},{"issue":"1","key":"10.1016\/S0304-3975(98)90244-4_BIB11","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1137\/S0097539794278396","article-title":"Shared memory consistency conditions for nonsequential execution: definitions and programming strategies","volume":"27","author":"Attiya","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)90244-4_BIB12","series-title":"Proc. 24th Annu. ACM Symp. on Theory of Computing","first-page":"679","article-title":"A correctness condition for high-performance multiprocessors","author":"Attiya","year":"1992"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB13","series-title":"Proc. 6th Annu. ACM Symp. on Parallel Algorithms and Architectures","first-page":"157","article-title":"Programming DEC-alpha based multiprocessors the easy way","author":"Attiya","year":"1994"},{"issue":"5","key":"10.1016\/S0304-3975(98)90244-4_BIB14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0020-0190(96)00007-5","article-title":"Limitations of fast consistency conditions for distributed shared memory","volume":"57","author":"Attiya","year":"1996","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0304-3975(98)90244-4_BIB15_1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/176575.176576","article-title":"Sequential consistency versus linearizability","volume":"12","author":"Attiya","year":"1994","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB15_2","series-title":"Proc. 3rd Annu. ACM Symp. on Parallel Algorithms and Architectures","first-page":"304","author":"Attiya","year":"1991"},{"year":"1998","series-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"Attiya","key":"10.1016\/S0304-3975(98)90244-4_BIB16"},{"issue":"3","key":"10.1016\/S0304-3975(98)90244-4_BIB17","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/32.126768","article-title":"Orca: a language for parallel programming of distributed systems","volume":"18","author":"Bal","year":"1992","journal-title":"IEEE Trans. Software Eng."},{"year":"1987","series-title":"Concurrency Control and Recovery in Database Systems","author":"Bernstein","key":"10.1016\/S0304-3975(98)90244-4_BIB18"},{"issue":"1","key":"10.1016\/S0304-3975(98)90244-4_BIB19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/7351.7478","article-title":"Reliable communication in the presence of failures","volume":"5","author":"Birman","year":"1990","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB20","series-title":"Proc. 12th Annu. ACM Symp. on Principles of Distributed Computing","first-page":"121","article-title":"Designing algorithms for distributed systems using partially synchronized clocks","author":"Chaudhuri","year":"1993"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB21","series-title":"Proc. 11th IEEE Real-Time Systems Symp.","first-page":"166","article-title":"Agreeing on a leader in real time","author":"Coan","year":"1990"},{"year":"1998","series-title":"Linearizability in the presence of partial synchrony and under different delay assumptions","author":"Eleftheriou","key":"10.1016\/S0304-3975(98)90244-4_BIB22"},{"journal-title":"Encore 91 Series Technical Summary","year":"1991","key":"10.1016\/S0304-3975(98)90244-4_BIB23"},{"issue":"1","key":"10.1016\/S0304-3975(98)90244-4_BIB24","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/273865.273884","article-title":"Providing sequentially consistent shared objects using group and point-to-point communication","volume":"45","author":"Fekete","year":"1998","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/S0304-3975(98)90244-4_BIB25","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s004460050014","article-title":"Implementing high-level synchronization operations in hybrid consistency","volume":"9","author":"Friedman","year":"1995","journal-title":"Distrib. Comput."},{"key":"10.1016\/S0304-3975(98)90244-4_BIB26","series-title":"Proc. 3rd Annu. ACM Symp. on Parallel Algorithms and Architectures","first-page":"316","article-title":"Detecting violations of sequential consistency","author":"Gharachorloo","year":"1991"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB27","series-title":"Proc. 3rd Annu. ACM Symp. on Parallel Algorithms and Architectures","first-page":"177","article-title":"On testing cache-coherent shared memories","author":"Gibbons","year":"1994"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB28","series-title":"Proc. 3rd Annu. ACM Symp. on Parallel Algorithms and Architectures","first-page":"292","article-title":"Specifying non-blocking shared memories","author":"Gibbons","year":"1992"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB29","series-title":"Proc. 3rd Annu. ACM Symp. on Parallel Algorithms and Architectures","first-page":"292","article-title":"Proving sequential consistency of high-performance shared memories","author":"Gibbons","year":"1991"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB30","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0885-064X(85)90010-X","article-title":"Optimal precision in the presence of uncertainty","volume":"1","author":"Halpern","year":"1985","journal-title":"J. Complexity"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB31","series-title":"Proc. 7th Annu. ACM Symp. on Principles of Distributed Computing","first-page":"276","article-title":"Wait-free implementations of concurrent objects","author":"Herlihy","year":"1988"},{"issue":"3","key":"10.1016\/S0304-3975(98)90244-4_BIB32","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","article-title":"Linearizability: a correctness condition for concurrent objects","volume":"12","author":"Herlihy","year":"1990","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB33","series-title":"Proc. 10th Internat. Conf. on Distributed Computing Systems","first-page":"302","article-title":"Slow memory: weakening consistency to enhance concurrency in distributed shared memories","author":"Hutto","year":"1990"},{"issue":"5","key":"10.1016\/S0304-3975(98)90244-4_BIB34","first-page":"768","article-title":"Efficient linearizable implementation of shared FIFO queues and general objects on a distributed system","volume":"E81A","author":"Inoue","year":"1998","journal-title":"IEICE Trans. Fundamentals of Electronics, Communications, and Computer Sciences"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB35","series-title":"Proc. 11th Internat. Workshop on Distributed Algorithms (WDAG-97)","first-page":"200","article-title":"Fault tolerance bounds for memory consistency","volume":"vol. 1320","author":"James","year":"1997"},{"issue":"8","key":"10.1016\/S0304-3975(98)90244-4_BIB36","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1109\/TC.1987.5009516","article-title":"Clock synchronization in distributed real-time systems","volume":"C-36","author":"Kopetz","year":"1987","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB37","series-title":"Proc. 13th Annu. ACM Symp. on Principles of Distributed Computing","first-page":"32","article-title":"Making operations of concurrent data types fast","author":"Kosa","year":"1994"},{"issue":"9","key":"10.1016\/S0304-3975(98)90244-4_BIB38","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","article-title":"How to make a multiprocessor computer that correctly executes multiprocess programs","volume":"C-28","author":"Lamport","year":"1979","journal-title":"IEEE Trans. Computers"},{"issue":"2","key":"10.1016\/S0304-3975(98)90244-4_BIB39","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","article-title":"On interprocess communication","volume":"1","author":"Lamport","year":"1986","journal-title":"Distrib. Comput."},{"key":"10.1016\/S0304-3975(98)90244-4_BIB40","article-title":"How to make a correct multiprocess program execute correctly on a Multiprocessor","author":"Lamport","year":"1993","journal-title":"DEC SRC Research Report # 96"},{"article-title":"A scalable shared memory","year":"1988","author":"Lipton","key":"10.1016\/S0304-3975(98)90244-4_BIB41"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB42","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF02242709","article-title":"Practical uses of synchronized clocks in distributed systems","volume":"6","author":"Liskov","year":"1993","journal-title":"Distrib. Comput."},{"key":"10.1016\/S0304-3975(98)90244-4_BIB43","series-title":"Proc. 11th Internat. Workshop on Distributed Algorithms (WDAG-97)","first-page":"215","article-title":"Precedence-based memory models","volume":"vol. 1320","author":"Luchangco","year":"1997"},{"issue":"2\/3","key":"10.1016\/S0304-3975(98)90244-4_BIB44","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0019-9958(84)80033-9","article-title":"An upper and lower bound for clock synchronization","volume":"62","author":"Lundelius","year":"1984","journal-title":"Inform. and Control"},{"issue":"3","key":"10.1016\/S0304-3975(98)90244-4_BIB45","first-page":"219","article-title":"An introduction to input\/output automata","volume":"2","author":"Lynch","year":"1989","journal-title":"CWI Quarterly"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB46","series-title":"Proc. 29th Annu. Allerton Conf. on Communication, Control and Computing","first-page":"683","article-title":"Sequential consistency and linearizability: read\/write objects","author":"Mavronicolas","year":"1991"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB47","series-title":"Proc. 6th Internat. Workshop on Distributed Algorithms (WDAG'92)","first-page":"346","article-title":"Efficient strongly consistent implementations of shared Memory","volume":"vol. 647","author":"Mavronicolas","year":"1992"},{"issue":"1","key":"10.1016\/S0304-3975(98)90244-4_BIB48","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1145\/5001.5007","article-title":"Axioms for memory access in asynchronous hardware systems","volume":"8","author":"Misra","year":"1986","journal-title":"ACM Trans. Programming Languages Systems"},{"issue":"4","key":"10.1016\/S0304-3975(98)90244-4_BIB49","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/322154.322158","article-title":"The serializability of concurrent database updates","volume":"26","author":"Papadimitriou","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB50","series-title":"Proc. 5th Annu. ACM Symp. on Parallel Algorithms and Architectures","first-page":"11","article-title":"The verification of cache coherence protocols","author":"Pong","year":"1993"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB51","article-title":"An overview of clock synchronization","author":"Simons","year":"1988","journal-title":"IBM Technical Report RJ 6505"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB52","series-title":"Proc. 11th IEEE Real-Time Systems Symp.","first-page":"156","article-title":"New latency bounds for atomic broadcast","author":"Strong","year":"1990"},{"key":"10.1016\/S0304-3975(98)90244-4_BIB53","series-title":"Proc. 19th ACM Internat. Symp. on Computer Architecture","first-page":"2","article-title":"A performance study of memory consistency models","author":"Zucker","year":"1992"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598902444?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598902444?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:51:20Z","timestamp":1555390280000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598902444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397598902444"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)90244-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}