{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T07:03:25Z","timestamp":1725606205447},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642231773"},{"type":"electronic","value":"9783642231780"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23178-0_7","type":"book-chapter","created":{"date-parts":[[2011,9,10]],"date-time":"2011-09-10T07:15:58Z","timestamp":1315638958000},"page":"74-87","source":"Crossref","is-referenced-by-count":0,"title":["Looking for Efficient Implementations of Concurrent Objects"],"prefix":"10.1007","author":[{"given":"Achour","family":"Most\u00e9faoui","sequence":"first","affiliation":[]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","first-page":"23","volume-title":"Proc. 26th Int\u2019l ACM Symposium on Principles of Distributed Computing (PODC 2007)","author":"M.K. Aguilera","year":"2007","unstructured":"Aguilera, M.K., Frolund, S., Hadzilacos, V., Horn, S.L., Toueg, S.: Abortable and Query-abortable Objects and their Implementations. In: Proc. 26th Int\u2019l ACM Symposium on Principles of Distributed Computing (PODC 2007), pp. 23\u201332. ACM Press, New York (2007)"},{"key":"7_CR2","first-page":"370","volume-title":"Concurrency Control and Recovery in Database Systems","author":"P.A. Bernstein","year":"1987","unstructured":"Bernstein, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems, p. 370. Addison Wesley Publishing Company, Reading (1987)"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"E.W.D. Dijkstra","year":"1971","unstructured":"Dijkstra, E.W.D.: Hierarchical Ordering of Sequential Processes. Acta Informatica\u00a01(1), 115\u2013138 (1971)","journal-title":"Acta Informatica"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11561927_8","volume-title":"Distributed Computing","author":"F.E. Fich","year":"2005","unstructured":"Fich, F.E., Luchangco, V., Moir, M., Shavit, N.N.: Obstruction-free algorithms can be practically wait-free. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 78\u201392. Springer, Heidelberg (2005)"},{"issue":"6","key":"7_CR5","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00446-007-0046-9","volume":"20","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Kapalka, M., Kuznetsov, P.: The Weakest Failure Detectors to Boost Obstruction-freedom. Distributed Computing\u00a020(6), 415\u2013433 (2008)","journal-title":"Distributed Computing"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-73940-1_5","volume-title":"Parallel Computing Technologies","author":"R. Guerraoui","year":"2007","unstructured":"Guerraoui, R., Raynal, M.: From Unreliable Objects to Reliable Objects: The Case of Atomic Registers and Consensus. In: Malyshkin, V.E. (ed.) PaCT 2007. LNCS, vol.\u00a04671, pp. 47\u201361. Springer, Heidelberg (2007)"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M.P. Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-Free Synchronization. ACM Transactions on Programming Languages and Systems\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1109\/ICDCS.2003.1203503","volume-title":"Proc. 23th Int\u2019l IEEE Conference on Distributed Computing Systems (ICDCS 2003)","author":"M.P. Herlihy","year":"2003","unstructured":"Herlihy, M.P., Luchangco, V., Moir, M.: Obstruction-free Synchronization: Double-ended Queues as an Example. In: Proc. 23th Int\u2019l IEEE Conference on Distributed Computing Systems (ICDCS 2003), pp. 522\u2013529. IEEE Press, New York (2003)"},{"key":"7_CR9","first-page":"508","volume-title":"The Art of Multiprocessor Programming","author":"M.P. Herlihy","year":"2008","unstructured":"Herlihy, M.P., Shavit, N.: The Art of Multiprocessor Programming, p. 508. Morgan Kaufman Pub., San Francisco (2008)"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: 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"},{"issue":"1","key":"7_CR11","first-page":"1","volume":"SE5","author":"C.E. Hewitt","year":"1979","unstructured":"Hewitt, C.E., Atkinson, R.R.: Specification and Proof Techniques for Serializers. IEEE Transactions on Software Engineering\u00a0SE5(1), 1\u201321 (1979)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"10","key":"7_CR12","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/355620.361161","volume":"17","author":"C.A.R. Hoare","year":"1974","unstructured":"Hoare, C.A.R.: Monitors: an Operating System Structuring Concept. Communications of the ACM\u00a017(10), 549\u2013557 (1974)","journal-title":"Communications of the ACM"},{"key":"7_CR13","first-page":"295","volume-title":"Proc. 22th Int\u2019l ACM Symposium on Principles of Distributed Computing (PODC 2003)","author":"P. Jayanti","year":"2003","unstructured":"Jayanti, P.: Adaptive and Efficient Abortable Mutual Exclusion. In: Proc. 22th Int\u2019l ACM Symposium on Principles of Distributed Computing (PODC 2003), pp. 295\u2013304. ACM Press, New York (2003)"},{"issue":"9","key":"7_CR14","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"C28","author":"L. Lamport","year":"1979","unstructured":"Lamport, L.: How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs. IEEE Transactions on Computers\u00a0C28(9), 690\u2013691 (1979)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On Interprocess Communication, Part 1: Basic formalism, Part II: Algorithms. Distributed Computing\u00a01(2), 77\u2013101 (1986)","journal-title":"Distributed Computing"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"Lamport, L.: A Fast Mutual Exclusion Algorithm. ACM Transactions on Computer Systems\u00a05(1), 1\u201311 (1987)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"3","key":"7_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 Mutual Exclusion. Information Processing Letters\u00a012(3), 115\u2013116 (1981)","journal-title":"Information Processing Letters"},{"key":"7_CR18","first-page":"107","volume-title":"Algorithms for Mutual Exclusion","author":"M. Raynal","year":"1986","unstructured":"Raynal, M.: Algorithms for Mutual Exclusion, p. 107. The MIT Press, Cambridge (1986); ISBN 0-262-18119-3"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-540-87785-1_33","volume-title":"Software Technologies for Embedded and Ubiquitous Systems","author":"M. Raynal","year":"2008","unstructured":"Raynal, M.: Locks Considered Harmful: A Look at Non-traditional Synchronization. In: Brinkschulte, U., Givargis, T., Russo, S. (eds.) SEUS 2008. LNCS, vol.\u00a05287, pp. 369\u2013380. Springer, Heidelberg (2008)"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1109\/CISIS.2009.14","volume-title":"IEEE Int\u2019l Conference on Complex, Intelligent and Software Intensive Systems (CISIS 2009)","author":"M. Raynal","year":"2009","unstructured":"Raynal, M.: Shared Memory Synchronization in Presence of Failures: an Exercise-based Introduction. In: IEEE Int\u2019l Conference on Complex, Intelligent and Software Intensive Systems (CISIS 2009), pp. 9\u201318. IEEE Press, New York (2009)"},{"key":"#cr-split#-7_CR21.1","doi-asserted-by":"crossref","unstructured":"Raynal, M.: On the Implementation of Concurrent Objects. Technical Report 1968, IRISA, Universit?? de Rennes, France (2011);","DOI":"10.1007\/978-3-642-24541-1_33"},{"key":"#cr-split#-7_CR21.2","unstructured":"To appear in a Springer Verlag LNCS special issue dedicated to the 75th birthday of Brian Randell"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-92295-7_10","volume-title":"Distributed Computing and Networking","author":"N. Shafiei","year":"2008","unstructured":"Shafiei, N.: Non-blocking Array-Based Algorithms for Stacks and Queues. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds.) ICDCN 2009. LNCS, vol.\u00a05408, pp. 55\u201366. Springer, Heidelberg (2008)"},{"issue":"4","key":"7_CR23","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1145\/6110.214406","volume":"3","author":"I. Suzuki","year":"1985","unstructured":"Suzuki, I., Kasami, T.: A Distributed Mutual Exclusion Algorithm. ACM Transactions on Computer Systems\u00a03(4), 344\u2013349 (1985)","journal-title":"ACM Transactions on Computer Systems"},{"key":"7_CR24","first-page":"423","volume-title":"Synchronization Algorithms and Concurrent Programming","author":"G. Taubenfeld","year":"2006","unstructured":"Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming, p. 423. Pearson Prentice-Hall, London (2006); ISBN 0-131-97259-6"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-540-75142-7_34","volume-title":"Distributed Computing","author":"G. Taubenfeld","year":"2007","unstructured":"Taubenfeld, G.: Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 450\u2013464. Springer, Heidelberg (2007)"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-04355-0_17","volume-title":"Distributed Computing","author":"G. Taubenfeld","year":"2009","unstructured":"Taubenfeld, G.: Contention-Sensitive Data Structures and Algorithms. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 157\u2013171. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23178-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T07:52:59Z","timestamp":1560585179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23178-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642231773","9783642231780"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23178-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}