On the implementation of concurrent objects
作者： Michel Raynal
DOI: 10.1007/978-3-642-24541-1_33
关键词: The Internet 、 Shared memory 、 Distributed computing 、 Linearizability 、 Liveness 、 Concurrent computing 、 Timestamp 、 Computer science 、 Asynchronous communication 、 Atomicity
摘要: The implementation of objects shared by concurrent processes, with provable safety and liveness guarantees, is a fundamental issue programming in memory systems. It now largely accepted that linearizability (or atomicity) an appropriate consistency condition for objects. On the side, progress conditions (mainly absence deadlock or stronger starvation) have been stated investigated long time are well-mastered. situation different asynchronous systems prone to process failures. This paper visits three suited presence failures, namely obstruction-freedom, non-blocking wait-freedom. To end, also computation models paradigm problems illustrate this family conditions. has consequently introductory survey flavor. Its aim help people better understand difficulties, subtleties beauties encountered when one implement despite net effect asynchrony failures.
springer.com
sci-hub.st 参考文章(55)
Gadi Taubenfeld, Synchronization Algorithms And Concurrent Programming ,(2006)
Romit Roy Choudhury, Haifeng Yu, Vikram Srinivasan, Nitin H. Vaidya, Marcos K. Aguilera, Distributed Computing and Networking ,(2008)
Michel Raynal, Locks Considered Harmful: A Look at Non-traditional Synchronization software technologies for embedded and ubiquitous systems. pp. 369- 380 ,(2008) , 10.1007/978-3-540-87785-1_33
Hagit Attiya, Jennifer L. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics ,(1998)
Damien Imbs, Michel Raynal, The x-wait-freedom progress condition european conference on parallel processing. pp. 584- 595 ,(2010) , 10.1007/978-3-642-15277-1_55
Timothy L. Harris, Keir Fraser, Ian A. Pratt, A Practical Multi-word Compare-and-Swap Operation Lecture Notes in Computer Science. pp. 265- 279 ,(2002) , 10.1007/3-540-36108-1_18
Edya Ladan-Mozes, Nir Shavit, An Optimistic Approach to Lock-Free FIFO Queues international symposium on distributed computing. pp. 117- 131 ,(2004) , 10.1007/978-3-540-30186-8_9
Nathan Goodman, Philip A. Bernstein, Vassco Hadzilacos, Concurrency Control and Recovery in Database Systems ,(1987)
Niloufar Shafiei, Non-blocking Array-Based Algorithms for Stacks and Queues Distributed Computing and Networking. pp. 55- 66 ,(2008) , 10.1007/978-3-540-92295-7_10
Gadi Taubenfeld, Contention-sensitive data structures and algorithms international symposium on distributed computing. pp. 157- 171 ,(2009) , 10.1007/978-3-642-04355-0_17