{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:39Z","timestamp":1760202519960,"version":"3.32.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1007\/bf02280835","type":"journal-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T16:09:20Z","timestamp":1138205360000},"page":"213-221","source":"Crossref","is-referenced-by-count":2,"title":["Atomicm-register operations"],"prefix":"10.1007","volume":"7","author":[{"given":"Michael","family":"Merritt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gadi","family":"Taubenfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02280835_CR1","doi-asserted-by":"crossref","unstructured":"Afek Y, Attiya H, Dolev D, Gafni M, Merritt M, Shavit N: Atomic snapshots. In: Proc of the 9th Annual ACM Symp on Principles of Distributed Computing, pp 1\u201313, August 1990 (to appear in J ACM)","DOI":"10.1145\/93385.93394"},{"key":"BF02280835_CR2","unstructured":"Anderson JH: Composite registers. Tech Rep TR-89-25, Department of Computer Science, The University of Texas at Austin, September 1989"},{"key":"BF02280835_CR3","unstructured":"Anderson JH: Multiple-writer composite registers. Tech Rep TR-89-26, Department of Computer Science, The University of Texas at Austin, September 1989"},{"key":"BF02280835_CR4","doi-asserted-by":"crossref","unstructured":"Bloom B: Constructing two-writer atomic registers. In: Proc 6th ACM Symp on Principles of Distributed Computing, pp 249\u2013259, 1987.","DOI":"10.1145\/41840.41861"},{"key":"BF02280835_CR5","unstructured":"Burns JE, Lynch AN: Bounds on shared memory for mutual exclusion. Inf Comput (to appear.) An early version appeared in the Proceedings of 18th Annual Allerton Conference on Communication, Control and Computing, 1980, pp 833\u2013842"},{"key":"BF02280835_CR6","doi-asserted-by":"crossref","unstructured":"Chandy KM, Misra J: Parallel program design: a foundation. Addison-Wesley, 1988","DOI":"10.1007\/978-1-4613-9668-0_6"},{"issue":"1","key":"BF02280835_CR7","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/inco.1993.1043","volume":"105","author":"S Chaudhuri","year":"1993","unstructured":"Chaudhuri S: More choices allow more faults: set consensus problems in totally asynchronous systems. Inf Comput 105(1): 132\u2013158 (1993)","journal-title":"Inf Comput"},{"key":"BF02280835_CR8","doi-asserted-by":"crossref","unstructured":"Chor B, Israeli A, Li M: On processor coordination using asynchronous hardware. In: Proc 6th ACM Symp on Principles of Distributed Computing, pp 86\u201397, 1987","DOI":"10.1145\/41840.41848"},{"key":"BF02280835_CR9","doi-asserted-by":"crossref","unstructured":"Cole R, Zajicek O: The APRAM: Incorporating asynchrony into the PRAM model In: Proc of the 1989 ACM Symp on Parallel algorithms and Architectures, pp 169\u2013178, June 1989","DOI":"10.1145\/72935.72954"},{"issue":"2","key":"BF02280835_CR10","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer MJ, Lynch NA, Paterson MS: Impossibility of distributed consensus with one faulty process. J ACM 32(2): 374\u2013382 (1985)","journal-title":"J ACM"},{"issue":"1","key":"BF02280835_CR11","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"11","author":"M Herlihy","year":"1991","unstructured":"Herlihy M: Wait-free synchronization. ACM Trans Program Lang Syst 11(1): 124\u2013149 (1991)","journal-title":"ACM Trans Program Lang Syst"},{"issue":"2","key":"BF02280835_CR12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport L: On interprocess communication, parts I and II. Distrib Comput 1(2): 77\u2013101 (1986)","journal-title":"Distrib Comput"},{"issue":"1","key":"BF02280835_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L Lamport","year":"1987","unstructured":"Lamport L: A fast mutual exclusion algorithm. ACM Trans Comput Syst 5(1): 1\u201311 (1987)","journal-title":"ACM Trans Comput Syst"},{"key":"BF02280835_CR14","first-page":"163","volume":"4","author":"MC Loui","year":"1987","unstructured":"Loui MC, Abu-Amara H: Memory requirements for agreement among unreliable asynchronous processes. Adv Comput Res 4: 163\u2013183 (1987)","journal-title":"Adv Comput Res"},{"key":"BF02280835_CR15","doi-asserted-by":"crossref","unstructured":"Peterson GL, Burns JE: Concurrent reading while writing ii: the multiwriter case. In: Proc 28th IEEE Symp on Foundations of Computer Science, pp 383\u2013392, 1987","DOI":"10.1109\/SFCS.1987.15"},{"key":"BF02280835_CR16","doi-asserted-by":"crossref","unstructured":"Peterson GL, Fischer MJ: Economical solutions for the critical section problem in a distributed system. In: Proc 9th ACM Symp on Theory of Computing, pp 91\u201397, 1977","DOI":"10.1145\/800105.803398"},{"key":"BF02280835_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0020-0190(91)90221-3","volume":"37","author":"G Taubenfeld","year":"1991","unstructured":"Taubenfeld G: On the nonexistence of resilient consensus protocols. Inf Process Lett 37: 285\u2013289 (1991)","journal-title":"Inf Process Lett"},{"key":"BF02280835_CR18","doi-asserted-by":"crossref","unstructured":"Taubenfeld G, Moran S: Possibility and impossibility results in a shared memory environment. In: 3rd International Workshop on Distributed Algorithms. In: Bermond JC, Raynal M, (eds) Lect Notes Comput Sci vol 392. Springer 1989, pp 254\u2013267","DOI":"10.1007\/3-540-51687-5_48"},{"key":"BF02280835_CR19","unstructured":"Vitanyi PMB, Awerbuch B: Atomic shared register access by asynchronous hardware. In: Proc 27th IEEE Symp on Foundations of Computer Science, pp 223\u2013243, 1986 Errata, Ibid. Vitanyi PMB, Awerbuch B: Atomic shared register access by asynchronous hardware. In: Proc 27th IEEE Symp on Foundations of Computer Science, pp 223\u2013243, 1987"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02280835.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02280835\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02280835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T12:06:49Z","timestamp":1736251609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02280835"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["BF02280835"],"URL":"https:\/\/doi.org\/10.1007\/bf02280835","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}