Concurrent programming: Algorithms, principles, and foundations

Concurrent Programming: Algorithms, Principles, and Foundations

Volumn 9783642320279, Issue , 2013, Pages 1-515

  Raynal, Michel ^a  

^a INSTITUT UNIVERSITAIRE DE FRANCE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONCURRENCY CONTROL; EDUCATION; ENGINEERING EDUCATION; MEMORY ARCHITECTURE; SYNCHRONIZATION;

COMPUTER ENGINEERING; CONCURRENT PROGRAMMING; CONSISTENCY CRITERIA; LOCK-BASED SYNCHRONIZATION; PROCESS SYNCHRONIZATION; SCIENTIFIC FOUNDATIONS; UNDERGRADUATE STUDENTS; UNIVERSAL CONSTRUCTIONS;

STUDENTS;

EID: 84948082664     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-642-32027-9     Document Type: Book

References (275)

1. I. Abraham, G.V. Chockler, I. Keidar, D. Malkhi, Byzantine disk Paxos, optimal resilience with Byzantine shared memory. Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC'04), St. John's, 2004 (ACM Press, New York, 2004), pp. 226-235
2. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, N. Shavit, Atomic snapshots of shared memory. J. ACM 40(4), 873-890 (1993)
3. Y. Afek, G. Brown, M. Merritt, Lazy caching. ACM Trans. Program. Lang. Syst. 15(1), 182-205 (1993)
4. Y. Afek, D. Dauber, D. Touitou, Wait-free made fast. Proceedings of the 27th ACM Symposium on Theory of Computing (STOC'00), Portland, 2000 (ACM Press, New York, 2000), pp. 538-547
5. Y. Afek, E. Gafni, A. Morisson, Common2 extended to stacks and unbounded concurrency. Distrib. Comput. 20(4), 239-252 (2007)
6. Y. Afek, E. Gafni, S. Rajsbaum, M. Raynal, C. Travers, The k-simultaneous consensus problem. Distrib. Comput. 22(3), 185-195 (2010)
7. Y. Afek, I. Gamzu, I. Levy, M. Merritt, G. Taubenfeld, Group renaming. Proceedings of the 12th International Conference on Principles of Distributed Systems (OPODIS'08), Luxor, 2008. LNCS, Vol. 5401 (Springer, Berlin, 2006), pp. 58-72
8. Y. Afek, D. Greenberg, M. Merritt, G. Taubenfeld, Computing with faulty shared objects. J. ACM 42(6), 1231-1274 (1995)
9. Y. Afek, M. Merritt, Fast wait-free (2k - 1)-renaming. Proceedings of the 18th ACM Symposium on Principles of Distributed Computing (PODC'99), Atlanta, 1999 (ACM Press, New York, 1999), pp. 105-112
10. Y. Afek, M. Merritt, G. Taubenfeld, The power of multi-objects. Inf. Comput. 153, 213-222 (1999)
11. Y. Afek, M. Merritt, G. Taubenfeld, D. Touitou, Disentangling multi-object operations. Proceedings of the 16th International ACM Symposium on Principles of Distributed Computing (PODC'97), Santa Barbara, 1997 (ACM Press, New York, 1997), pp. 262-272
12. Y. Afek, G. Stupp, D. Touitou, Long-lived adaptive collect with applications. Proceedings of the 40th IEEE Symposium on Foundations of Computer Science Computing (FOCS'99), New York, 1999 (IEEE Computer Press, New York, 1999), pp. 262-272
13. Y. Afek, E. Weisberger, H. Weisman, A completeness theorem for a class of synchronization objects. Proceedings of the 12th International ACM Symposium on Principles of Distributed Computing (PODC'93), Ithaca, 1993 (ACM Press, New York, 1993), pp. 159-168
14. M.K. Aguilera, A pleasant stroll through the land of infinitely many creatures. ACM SIGACT News, Distrib. Comput. Column 35(2), 36-59 (2004)
15. M.K. Aguilera, B. Englert, E. Gafni, On using network attached disks as shared memory. Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC'03), Boston, 2003 (ACM Press, New York, 2003), pp. 315-324
16. M.K. Aguilera, S. Frolund, V. Hadzilacos, S.L. Horn, S. Toueg, Abortable and queryabortable objects and their efficient implementation. Proceedings of the 26th ACM Symposium on Principles of Distributed Computing (PODC'07), Portland, 2007 (ACM Press, New York, 2007), pp. 23-32
17. M. Ahamad, G. Neiger, J.E. Burns, P. Kohli, Ph.W. Hutto, Causal memory: definitions, implementation, and programming. Distrib. Comput. 9(1), 37-49 (1995)
18. D. Alistarh, J. Aspnes, S. Gilbert, R. Guerraoui, The complexity of renaming. Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011), Palm Springs, 2011 (IEEE Press, New York, 2011), pp. 718-727
19. D. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, R. Guerraoui, Fast randomized test-and-set and renaming. Proceedings of the 14th International Symposium on Distributed Computing (DISC'00), Cambridge, 2010. LNCS, Vol. 6343 (Springer, Heidelberg, 2010), pp. 94-108
20. B. Alpern, F.B. Schneider, Defining liveness. Inf. Process. Lett. 21(4), 181-185 (1985)
21. J.H. Anderson, Composite registers. Proceedings of the 9th ACM Symposium on Principles of Distributed Computing (PODC'90), Quebec City, 1990 (ACM Press, New York, 1990), pp. 15-29
22. J.H. Anderson, Multi-writer composite registers. Distrib. Comput. 7(4), 175-195 (1994)
23. J.H. Anderson, Y.J. Kim, Adaptive local exclusion with local spinning. Proceedings of the 14th International Symposium on Distributed Computing (DISC'00), Toledo, 2000. LNCS, Vol. 1914 (Springer, Heidelberg, 2000), pp. 29-43
24. J.H. Anderson, Y.J. Kim, T. Herman, Shared memory mutual exclusion: major research trends since 1986. Distrib. Comput. 16, 75-110 (2003)
25. J. Anderson, M. Moir, Universal constructions for multi-object operations. Proceedings of the 14th International ACM Symposium on Principles of Distributed Computing (PODC'95), Ottawa, 1995 (ACM Press, New York, 1995), pp. 184-195
26. J. Anderson, M. Moir, Universal constructions for large objects. IEEE Trans. Parallel Distrib. Syst. 10(12), 1317-1332 (1999)
27. G.R. Andrews, Concurrent Programming, Principles and Practice (Benjamin/Cumming, Redwood City, 1993), 637 pp
28. A.A. Aravind, Yet another simple solution to the concurrent programming control problem. IEEE Tran. Parallel Distrib. Syst. 22(6), 1056-1063 (2011)
29. H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, R. Reischuk, Renaming in an asynchronous environment. J. ACM 37(3), 524-548 (1990)
30. H. Attiya, E. Dagan, Improved implementations of universal binary operations. J. ACM 48(5), 1013-1037 (2001)
31. H. Attiya, F. Ellen, P. Fatourou, The complexity of updating snapshot objects. J. Parallel Distrib. Comput. 71(12), 1570-1577 (2010)
32. H. Attiya, A. Fouren, Polynomial and adaptive long-lived (2p - 1)-renaming. Proceedings of the 14th International Symposium on Distributed Computing (DISC'00), Toledo, 2000. LNCS, Vol. 1914 (Springer, Heidelberg, 2000), pp. 149-163
33. H. Attiya, A. Fouren, Adaptive and efficient algorithms for lattice agreement and renaming. SIAM J. Comput. 31(2), 642-664 (2001)
34. H. Attiya, A. Fouren, Algorithms adapting to point contention. J. ACM 50(4), 444-468 (2003)
35. H. Attiya, A. Fouren, E. Gafni, An adaptive collect algorithm with applications. Distrib. Comput. 15(2), 87-96 (2002)
36. H. Attiya, R. Guerraoui, E. Ruppert, Partial snapshot objects. Proceedings of the 20th ACM Symposium on Parallel Architectures and Algorithms (SPAA'08), Munich, 2008 (ACM Press, New York, 2008), pp. 336-343
37. H. Attiya, E. Hillel, Highly concurrent multi-word synchronization. Proceedings of the 9th International Conference on Distributed Computing and Networking (ICDCN'08), Kolkata, 2008. LNCS, Vol. 4904 (Springer, Heidelberg, 2008), pp. 112-123
38. H. Attiya, E. Hillel, Single-version STM can be multi-version permissive. Proceedings of the 12th International Conference on Distributed Computing and Networking (ICDCN'11), Bangalore, 2011. LNCS, Vol. 6522 (Springer, Heidelberg, 2011), pp. 83-94
39. H. Attiya, O. Rachmann, Atomic snapshots in O(n log n) operations. SIAM J. Comput. 27(2), 319-340 (1998)
40. H. Attiya, J.L. Welch, Sequential consistency versus linearizability. ACM Trans. Comput. Syst. 12(2), 91-122 (1994)
41. H. Attiya, J.L. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. (Wiley-Interscience, New York, 2004), 414 pp. ISBN 0-471-45324-2
42. H. Avni, N. Shavit, Maintaining consistent transactional states without a global clock. Proceedings of the 15th Colloquium on Structural Information and Communication Complexity (SIROCCO'08), Villars-sur-Ollon, 2008. LNCS, Vol. 5058 (Springer, Heidelberg, 2008), pp. 121-140
43. B. Awerbuch, L.M. Kirousis, E. Kranakis, P. Vitányi, A proof technique for register atomicity. Proceedings of the 8th International Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), LNCS, Vol. 338 (Springer, 1988), pp. 286-303
44. T. Axford, Concurrent programming. Fundamental techniques for real-time and parallel software design. Wiley Series in Parallel Computing (Wiley, New York, 1989), 250 pp
45. Ö. Babaoglu, K. Marzullo, Consistent global states of distributed systems: fundamental concepts and mechanisms. Chapter 4 in Distributed Systems. Frontier Series (ACM Press, New York, 1993), pp. 55-93
46. Y. Bar-David, G. Taubenfeld, Automatic discovery of mutual exclusion algorithms. Proceedings of the 17th International Symposium on Distributed Computing (DISC'03), Sorrento, 2003. LNCS, Vol. 2648 (Springer, Heidelberg, 2003), pp. 136-150
47. G. Barnes, A method for implementing lock-free shared data structures. Proceedings of the 5th International ACM Symposium on Parallel Algorithms and Architectures (SPAA'93), Venlo, 1993 (ACM Press, New York, 1993), pp. 261-270
48. A.J. Bernstein, Predicate transfer and timeout in message passing systems. Inf. Process. Lett. 24(1), 43-52 (1987)
49. A.J. Bernstein, Ph.L. Lewis, Concurrency in Programming and Database Systems (John and Bartlett, Boston, 1993), 548 pp
50. Ph.A. Bernstein, V. Hadzilacos, N. Goodman, Concurrency Control and Recovery in Database Systems (Addison-Wesley, Reading, 1987), 370 pp
51. Ph.A. Bernstein, D.W. Shipman, W.S. Wong, Formal aspects of serializability in database concurrency control. IEEE Trans. Softw. Eng. SE-5(3), 203-216 (1979)
52. B. Bloom, Constructing two-writer atomic register. IEEE Trans. Comput. 37, 1506-1514 (1988)
53. E. Borowsky, E. Gafni, Immediate atomic snapshots and fast renaming. Proceedings of the 12th ACM Symposium on Principles of Distributed Computing (PODC'93), Ithaca, 1993, pp. 41-51
54. E. Borowsky, E. Gafni, A simple algorithmically reasoned characterization of wait-free computations. Proceedings of the 16th ACM Symposium on Principles of Distributed Computing (PODC'97), Santa Barbara, 1997 (ACM Press, New York, 1997), pp. 189-198
55. E. Borowsky, E. Gafni, Y. Afek, On processor coordination with asynchronous hardware. Consensus power makes (some) sense. Proceedings of the 13th ACM Symposium on Principles of Distributed Computing (PODC'94), Los Angeles, 1994 (ACM Press, New York, 1994), pp. 363-372
56. P. Brinch Hansen, Shared classes. In Operating Systems Principles (Section 7.2) (Prentice Hall, Englewood Cliffs, 1973), pp. 226-232
57. P. Brinch Hansen, The Architecture of Concurrent Programs (Prentice Hall, Englewood Cliffs, 1977), 317 pp
58. P. Brinch Hansen (ed.), The Origin of Concurrent Programming (Springer, Heidelberg, 2002), 534 pp
59. J.E. Burns, G.L. Peterson, Constructing multireader atomic values from non-atomic values. Proceedings of the 6th ACM Symposium on Principles of Distributed Computing (PODC'87), Vancouver, 1987 (ACM Press, New York, 1987), pp. 222-231
60. Ch. Cachin, R. Guerraoui, L. Rodrigues, Introduction to Reliable and Secure Distributed Programming (Springer, New York, 2011), 320 pp
61. J. Cachopo, A. Rito-Silva, Versioned boxes as the basis for transactional memory. Sci. Comput. Program. 63(2), 172-175 (2006)
62. R.H. Campbell, Predicates path expressions. Proceedings of the 6th ACM Symposium on Principles of Programming Languages (POPL'79), San Antonio, 1979 (ACM Press, New York, 1979), pp. 226-236
63. R.H. Campbell, N. Haberman, The specification of process synchronization by path expressions. Proceedings of the International Conference on Operating Systems, LNCS, Vol. 16 (Springer, Berlin, 1974), pp. 89-102
64. R.H. Campbell, R.B. Kolstad, Path expressions in Pascal. Proceedings of the 4th International Conference on Software Engineering (ICSE'79), Munich, 1979 (ACM Press, New York, 1979), pp. 212-219
65. A. Castañeda, S. Rajsbaum, New combinatorial topology upper and lower bounds for renaming: the lower bound. Distrib. Comput. 22(5), 287-301 (2010)
66. A. Castañeda, S. Rajsbaum, M. Raynal, The renaming problem in shared memory systems: an introduction. Elsevier Comput. Sci. Rev. 5, 229-251 (2011)
67. T. Chandra, S. Toueg, Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225-267 (1996)
68. T. Chandra, V. Hadzilacos, S. Toueg, The weakest failure detector for solving consensus. J. ACM 43(4), 685-722 (1996)
69. K.M. Chandy, J. Misra, Parallel Program Design (Addison-Wesley, Reading, 1988), 516 pp
70. B. Charron-Bost, R. Cori, A. Petit, Introduction à l'algorithmique des objets partagés. RAIRO Informatique Théorique et Applications 31(2), 97-148 (1997)
71. S. Chaudhuri, More choices allow more faults: set consensus problems in totally asynchronous systems. Inf. Comput. 105(1), 132-158 (1993)
72. S. Chaudhuri, M.J. Kosa, J. Welch, One-write algorithms for multivalued regular and atomic registers. Acta Inform. 37, 161-192 (2000)
73. S. Chaudhuri, J. Welch, Bounds on the cost of multivalued registers implementations. SIAM J. Comput. 23(2), 335-354 (1994)
74. G.V. Chockler, D. Malkhi, Active disk Paxos with infinitely many processes. Distrib. Comput. 18(1), 73-84 (2005)
75. G.V. Chockler, D. Malkhi, Light-weight leases for storage-centric coordination. Int. J. Parallel Prog. 34(2), 143-170 (2006)
76. B. Chor, A. Israeli, M. Li, On processor coordination with asynchronous hardware. Proceedings of the 6th ACM Symposium on Principles of Distributed Computing (PODC'87), Vancouver, 1987 (ACM Press, New York, 1987), pp. 86-97
77. Ph. Chuong, F. Ellen, V. Ramachandran, A universal construction for wait-free transaction friendly data structures. Proceedings of the 22nd International ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'10), Santorini, 2010 (ACM Press, New York, 2010), pp. 335-344
78. R. Colvin, L. Groves, V. Luchangco, M. Moir, Formal verification of a lazy concurrent list-based set algorithm. Proceedings of the 18th International Conference on Computer Aided Verification (CAV'06), Seattle, 2006. LNCS, Vol. 4144 (Springer, Heidelberg, 2006), pp. 475-488
79. Th.M. Cormen, Ch.E. Leiserson, R.L. Rivest, Introduction to Algorithms (The MIT Press, Cambridge, 1998), 1028 pp
80. P.J. Courtois, F. Heymans, D.L. Parnas, Concurrent control with ''readers'' and ''writers''. Commun. ACM 14(5), 667-668 (1971)
81. T. Crain, V. Gramoli, M. Raynal, A speculation-friendly binary search tree. Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'12), New Orleans, 2012 (ACM Press, New York, 2012), pp. 161-170
82. T. Crain, D. Imbs, M. Raynal, Read invisibility, virtual world consistency and probabilistic permissiveness are compatible. Proceedings of the 11th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP'11), Melbourne, 2011. LNCS, Vol. 7016 (Springer, Berlin, 2011), pp. 245-258
83. T. Crain, D. Imbs, M. Raynal, Towards a universal construction for transaction-based multiprocess programs. Proceedings of the 13th International Conference on Distributed Computing and Networking (ICDCN'12), Hong Kong, 2012. LNCS, Vol. 7129, (Springer, Berlin, 2012), pp. 61-75
84. C. Delporte-Gallet, H. Fauconnier, Two consensus algorithms with atomic registers and failure detector X. Proceedings of the 10th International Conference on Distributed Computing and Networking (ICDCN'09), Hyderabad, 2009. LNCS, Vol. 5408 (Springer, Heidelberg, 2009), pp. 251-262
85. P.J. Denning, J.B. Dennis, J.E. Qualitz, Machines Languages and Computation (Prentice Hall, Englewood Cliffs, 1978), 612 pp
86. D. Dice, V.J. Marathe, N. Shavit, Lock cohorting: a general technique for designing NUMA locks. Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'12), New Orleans, 2012 (ACM Press, New York, 2012), pp. 247-256
87. D. Dice, O. Shalev, N. Shavit, Transactional locking II. Proceedings of the 20th International Symposium on Distributed Computing (DISC'06), Stockholm, 2006. LNCS, Vol. 4167 (Springer, Heidelberg, 2006), pp. 194-208
88. E.W. Dijkstra, Solution of a problem in concurrent programming control. Commun. ACM 8(9), 569 (1965)
89. E.W. Dijkstra, Cooperating Sequential Processes. In Programming Languages, ed. by F. Genuys (Academic Press, New York, 1968), pp. 43-112
90. E.W. Dijkstra, Hierarchical ordering of sequential processes. Acta Inform. 1(1), 115-138 (1971)
91. A.B. Downey, The Little Book of Semaphores, 2nd edn, version 2.1.2. (Green Tea Press, Virginia, 2005), 291 pp. http://www.greenteapress.com/semaphores/downey05semaphores.pdf
92. P. Dutta, R. Guerraoui, Fast indulgent consensus with zero degradation. Proceedings of the 4th European Dependable Computing Conference (EDCC'02), Toulouse, 2002. LNCS, Vol. 2485 (Springer, Heidelberg, 2002), pp. 191-208
93. F. Ellen, How hard is it to take a snapshot? Proceedings of the 31st Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'05), Liptovský Ján, 2005. LNCS, Vol. 3381 (Springer, Heidelberg, 2005), pp. 28-37
94. B. Englert, E. Gafni, Fast collect in the absence of contention. Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS'02), Vienna, 2002 (IEEE Press, New York, 2002), pp. 537-543
95. P. Fatourou, N.D. Kallimanis, The red-blue adaptive universal construction. Proceedings of the 22nd International Symposium on Distributed Computing (DISC'09), Elche, 2009. LNCS, Vol. 5805 (Springer, Berlin, 2009), pp. 127-141
96. P. Fatourou, N.D. Kallimanis, A highly-efficient wait-free universal construction. Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'11), San Jose, 2011 (ACM Press, New York, 2011), pp. 325-334
97. A. Fekete, N. Lynch, M. Merritt, W. Weihl, Atomic Transactions (Morgan Kaufmann, San Mateo, 1994)
98. P. Felber, Ch. Fetzer, R. Guerraoui, T. Harris, Transactions are coming back, but are they the same? ACM SIGACT News, Distrib. Comput. Column 39(1), 48-58 (2008)
99. A. Fernández, E. Jiménez, M. Raynal, Electing an eventual leader in an asynchronous shared memory system. Proceedings of the 37th International IEEE Conference on Dependable Systems and Networks (DSN'07), Edinburgh, 2007 (IEEE Computer Society Press, New York, 2007), pp. 399-408
100. A. Fernández, E. Jiménez, M. Raynal, G. Trédan, A timing assumption and a t-resilient protocol for implementing an eventual leader in asynchronous shared memory systems. Proceedings of the 10th International IEEE Symposium on Objects and Component-Oriented Real-Time Computing (ISORC 2007), Santorini Island, May 2007 (IEEE Society Computer Press, New York, 2007), pp. 71-78
101. A. Fernández, E. Jiménez, M. Raynal, G. Trédan, A timing assumption and two t-resilient protocols for implementing an eventual leader service in asynchronous shared-memory systems. Algorithmica 56(4), 550-576 (2010)
102. M.J. Fischer, N.A. Lynch, M.S. Paterson, Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374-382 (1985)
103. A. Fouren, Exponential examples of two renaming algorithms. Technion Tech Report, 1999. http://www.cs.technion.ac.il/hagit/pubs/expo.ps.gz
104. R. Friedman, A. Mostéfaoui, M. Raynal, Asynchronous bounded lifetime failure detectors. Inf. Process. Lett. 94(2), 85-91 (2005)
105. E. Gafni, Round-by-round fault detectors: unifying synchrony and asynchrony. Proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC), Puerto Vallarta, 1998 (ACM Press, New York, 1998), pp. 143-152
106. E. Gafni, Group solvability. Proceedings of the 18th International Symposium on Distributed Computing (DISC'04), Amsterdam, 2004. LNCS, Vol. 3274 (Springer, Heidelberg, 2004), pp. 30-40
107. E. Gafni, Renaming with k-set consensus: an optimal algorithm in n + k - 1 slots. Proceedings of the 10th International Conference on Principles of Distributed Systems (OPODIS'06), Bordeaux, 2006. LNCS, Vol. 4305 (Springer, Heidelberg, 2006), pp. 36-44
108. E. Gafni, R. Guerraoui, Generalizing universality. Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11), Aachen, 2011. LNCS, Vol. 6901 (Springer, Berlin, 2011), pp. 17-27
109. E. Gafni, L. Lamport, Disk Paxos. Distrib. Comput. 16(1), 1-20 (2003)
110. E. Gafni, M. Merritt, G Taubenfeld, The concurrency hierarchy, and algorithms for unbounded concurrency. Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC'01), Newport, 2001, pp. 161-169
111. G Gafni, A. Mostéfaoui, M. Raynal, C. Travers, From adaptive renaming to set agreement. Theoret. Comput. Sci. 410(14-15), 1328-1335 (2009)
112. E. Gafni, S. Rajsbaum, Recursion in distributed computing. Proceedings of the 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'10), New York, 2010. LNCS, Vol. 6366 (Springer, Heidelberg, 2010), pp. 362-376
113. E. Gafni, M. Raynal, C. Travers, Test&set, adaptive renaming and set agreement: a guided visit to asynchronous computability. Proceedings of the 26th IEEE Symposium on Reliable Distributed Systems (SRDS'07), Beijing, 2007 (IEEE Computer Society Press, New York, 2007), pp. 93-102
114. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, New York, 1979), 340 pp
115. V.K. Garg, Elements of Distributed Computing (Wiley-Interscience, New York, 2002), 423 pp
116. A.J. Gerber, Process synchronization by counter variables. ACM Operating Syst. Rev. 11(4), 6-17 (1977)
117. A. Gottlieb, R. Grishman, C.P. Kruskal, K.P. McAuliffe, L. Rudolph, M. Snir, The NYU ultracomputer: designing an MIMD parallel computer. IEEE Trans. Comput. C-32(2), 175-189 (1984)
118. A. Gottlieb, B.D. Lubachevsky, L. Rudolph, Basic techniques for the efficient coordination of very large number of cooperating sequential processes. ACM Trans. Program. Lang. Syst. 5(2), 164-189 (1983)
119. J. Gray, A. Reuter, Transactions Processing: Concepts and Techniques (Morgan Kaufmann, San Mateo, 1992), 1070 pp
120. R. Guerraoui, Indulgent algorithms. Proceedings of the 19th ACM Symposium on Principles of Distributed Computing (PODC'00), Portland, 2000 (ACM Press, New York, 2000), pp. 289-298
121. R. Guerraoui, Th.A. Henzinger, V. Singh, Permissiveness in transactional memories. Proceedings of the 22nd International Symposium on Distributed Computing (DISC'08), Arcachon, 2008. LNCS, Vol. 5218 (Springer, Heidelberg, 2008), pp. 305-319
122. R. Guerraoui, M. Herlihy, B. Pochon, Towards a theory of transactional contention managers. Proceedings of the 24th International ACM Symposium on Principles of Distributed Computing (PODC'05), Las Vegas, 2005 (ACM Press, New York, 2005), pp. 258-264
123. R. Guerraoui, M. Kapałka, On the correctness of transactional memory. Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'08), Salt Lake City, 2008 (ACM Press, New York, 2008), pp. 175-184
124. R. Guerraoui, M. Kapałka, Principles of transactional memory. In Synthesis Lectures on Distributed Computing Theory (Morgan and Claypool, San Rafael, 2010), 180 pp
125. R. Guerraoui, M. Kapalka, P. Kuznetsov, The weakest failure detectors to boost obstruction-freedom. Distrib. Comput. 20(6), 415-433 (2008)
126. R. Guerraoui, N.A. Lynch, A general characterization of indulgence. ACM Trans. Auton. Adapt. Syst. 3(4), Article 20, 2008
127. R. Guerraoui, M. Raynal, The information structure of indulgent consensus. IEEE Trans. Comput. 53(4), 453-466 (2004)
128. R. Guerraoui, M. Raynal, A leader election protocol for eventually synchronous shared memory systems. Proceedings of the 4th International IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems (SEUS'06), Seattle, 2006 (IEEE Computer Society Press, New York, 2006), pp. 75-80
129. R. Guerraoui, M. Raynal, The alpha of indulgent consensus. Comput. J. 50(1), 53-67 (2007)
130. R. Guerraoui, M. Raynal, A universal construction for wait-free objects. Proceedings of the ARES 2007 Workshop on Foundations of Fault-Tolerant Distributed Computing (FOFDC 2007), Vienna, 2007 (IEEE Society Computer Press, New York, 2007), pp. 959-966
131. R. Guerraoui, M. Raynal, From unreliable objects to reliable objects: the case of atomic registers and consensus. Proceedings of the 9th International Conference on Parallel Computing Technologies (PaCT'07), Pereslavl-Zalessky, 2007. LNCS, Vol. 4671 (Springer, Heidelberg, 2007), pp. 47-61
132. S. Haldar, P.S. Subramanian, Space-optimal conflict-free construction of 1-writer 1-reader multivalued atomic register. Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG'94), Terschelling, 1994. LNCS, Vol. 857 (Springer, Berlin, 1994), pp. 116-129
133. S. Haldar, K. Vidyasankar, Constructing 1-writer multireader multivalued atomic variables from regular variables. J. ACM 42(1), 186-203 (1995)
134. T. Harris, A. Cristal, O.S. Unsal, E. Ayguade, F. Gagliardi, B. Smith, M. Valero, Transactional memory: an overview. IEEE Micro. 27(3), 8-29 (2007)
135. T.L. Harris, K. Fraser, I.A. Pratt, A practical multi-word compare-and-swap operation. Proceedings of the 16th Internationl Symposium on Distributed Computing (DISC'02), Toulouse, 2002. LNCS Vol. 2508 (Springer, Heidelberg, 2002), pp. 265-279
136. J.-M. Hélary, A. Mostéfaoui, M. Raynal, Interval consistency of asynchronous distributed computations. J. Comput. Syst. Sci. 64(2), 329-349 (2002)
137. S. Heller, M.P. Herlihy, V. Luchangco, M. Moir, W. Scherer III, N. Shavit, A lazy concurrent list-based algorithm. Parallel Process. Lett. 17(4), 411-424 (2007)
138. M.P. Herlihy, Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124-149 (1991)
139. M.P. Herlihy, A methodology for implementing highly concurrent data objects. ACM Trans. Programm. Lang. Syst. 15(5), 745-770 (1994)
140. M.P. Herlihy, V. Luchangco, Distributed computing and the multicore revolution. ACM SIGACT News 39(1), 62-72 (2008)
141. M. Herlihy, V. Luchangco, M. Moir, W.M. Scherer III, Software transactional memory for dynamic-sized data structures. Proceedings of the 22nd International ACM Symposium on Principles of Distributed Computing (PODC'03), Boston, 2003 (ACM Press, New York, 2003), pp. 92-101
142. M.P. Herlihy, V. Luchangco, P. Marin, M. Moir, Non-blocking memory management support for dynamic-size data structures. ACM Trans. Comput. Syst. 23(2), 146-196 (2005)
143. M.P. Herlihy, V. Luchangco, M. Moir, Obstruction-free synchronization: double-ended queues as an example. Proceedings of the 23rd International IEEE Conference on Distributed Computing Systems (ICDCS'03), Providence, 2003 (IEEE Press, New York, 2003), pp. 522-529
144. M.P. Herlihy, J.E.B. Moss, Transactional memory: architectural support for lock-free data structures. Proceedings of the 20th ACM International Symposium on Computer Architecture (ISCA'93), San Diego, 1993 (ACM Press, New York, 1993), pp. 289-300
145. M.P. Herlihy, N. Shavit, The topological structure of asynchronous computability. J. ACM 46(6), 858-923 (1999)
146. M. Herlihy, N. Shavit, The Art of Multiprocessor Programming (Morgan Kaufmann, San Mateo, 2008), 508 pp. ISBN 978-0-12-370591-4
147. M. Herlihy, N. Shavit, On the nature of progress. Proceedings of the 15th International Conference on Principles of Distributed Systems (OPODIS'11), Toulouse, 2011. LNCS, Vol. 7109 (Springer, London, 2011), pp. 313-328
148. M.P. Herlihy, J.M. Wing, Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463-492 (1990)
149. C.E. Hewitt, R.R. Atkinson, Specification and proof techniques for serializers. IEEE Trans. Softw. Eng. SE5(1), 1-21 (1979)
150. C.A.R. Hoare, Monitors: an operating system structuring concept. Commun. ACM 17(10), 549-557 (1974)
151. J.E. Hopcroft, R. Motwani, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, 2nd edn. (Addison-Wesley, Reading, 2001), 521 pp
152. J.H. Howard, Proving monitors. Commun. ACM 19(5), 273-279 (1976)
153. D. Imbs, J.R. de Mendivil, M. Raynal, Virtual world consistency: a new condition for STM systems. Brief announcement. Proceedings of the 28th ACM Symposium on Principles of Distributed Computing (PODC'09), Calgary, 2009 (ACM Press, New York, 2009), pp. 280-281
154. D. Imbs, S. Rajsbaum, M. Raynal, The universe of symmetry breaking tasks. Proceedings of the 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO'11), Gdansk, 2011. LNCS, Vol. 6796 (Springer, Heidelberg, 2011), pp. 66-77
155. D. Imbs, M. Raynal, A lock-based STM protocol that satisfies opacity and progressiveness. Proceedings of the 12th International Conference on Principles of Distributed Systems (OPODIS'08), Luxor, 2008. LNCS, Vol. 5401 (Springer, Heidelberg, 2008), pp. 226-245
156. D. Imbs, M. Raynal, Provable STM properties: leveraging clock and locks to favor commit and early abort. 10th International Conference on Distributed Computing and Networking (ICDCN'09), Hyderabad, January 2009. LNCS, Vol. 5408 (Springer, Berlin, 2009), pp. 67-78
157. D. Imbs, M. Raynal, A note on atomicity: boosting test&set to solve consensus. Inf. Process. Lett. 109(12), 589-591 (2009)
158. D. Imbs, M. Raynal, Help when needed, but no more: efficient read/write partial snapshot. J. Parallel Distrib. Comput. 72(1), 1-13 (2012)
159. D. Imbs, M. Raynal, The multiplicative power of consensus numbers. Proceedings of the 29th ACM Symposium on Principles of Distributed Computing (PODC'10), Zurich, 2010 (ACM Press, New York, 2010), pp. 26-35
160. D. Imbs, M. Raynal, On adaptive renaming under eventually limited contention. 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'10), New York, 2010. LNCS, Vol. 6366 (Springer, New York, 2010), pp. 377-387
161. D. Imbs, M. Raynal, A liveness condition for concurrent objects: x-wait-freedom. Concurr. Comput. Pract. Exp. 23, 2154-2166 (2011)
162. D. Imbs, M. Raynal, A simple snapshot algorithm for multicore systems. Proceedings of the 5th IEEE Latin-American Symposium on Dependable Computing (LADC'11), 2011 (IEEE Press, New York, 2011), pp. 17-23
163. D. Imbs, M. Raynal, Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations). Theoret. Comput. Sci. 444, 113-127 (2012)
164. D. Imbs, M. Raynal, G. Taubenfeld, On asymmetric progress conditions. Proceedings of the 29th ACM Symposium on Principles of Distributed Computing (PODC'10), Zurich, 2010 (ACM Press, New York, 2010), pp. 55-64
165. D. Inoue, W. Chen, T. Masuzawa, N. Tokura, Linear time snapshot using multi-reader multi-writer registers. Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG'94), Terschelling, 1994. LNCS, Vol. 857 (Springer, London, 1994), pp. 130-140
166. P. Jayanti, Robust wait-free hierarchies. J. ACM 44(4), 592-614 (1997)
167. P. Jayanti, An optimal multiwriter snapshot algorithm. Proceedings of the 37th ACM Symposium on Theory of Computing (STOC'05), Baltimore, 2005 (ACM Press, New York, 2005), pp. 723-732
168. P. Jayanti, J.E. Burns, G.L. Peterson, Almost optimal single reader single writer atomic register. J. Parallel Distrib. Comput. 60, 150-168 (2000)
169. P. Jayanti, T.D. Chandra, S. Toueg, Fault-tolerant wait-free shared objects. J. ACM 45(3), 451-500 (1998)
170. P. Jayanti, T.D. Chandra, S. Toueg, The cost of graceful degradation for omission failures. Inf. Process. Lett. 71, 167-172 (1999)
171. P. Jayanti, K. Tan, G. Friedland, A. Katz, Bounding Lamport's bakery algorithm. Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'01), Piestany, 2004. LNCS, Vol. 2234 (Springer, Berlin, 2004), pp. 261-270
172. P. Jayanti, S. Toueg, Some results on the impossibility, universality, and decidability of consensus. Proceedings of the 6th International Workshop on Distributed Algorithms (WDAG'92), Haifa, 1992. LNCS, Vol. 647 (Springer, Heidelberg, 1992), pp. 69-84
173. N.D. Kallimanis, P. Fatourou, Revisiting the combining synchronization technique. Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'12), New Orleans, 2012 (ACM Press, New York, 2012) pp. 257-266
174. J.L.W. Kessels, An alternative to event queues for synchronization in monitors. Commun. ACM 20(7), 500-503 (1977)
175. J.L.W. Kessels, Arbitration without common modifiable variables. Acta Inform. 17(2), 135-141 (1982)
176. J. Kleinberg, E. Tardos, Algorithm Design (Addison-Wesley, Pearson Education, New York, 2005), 838 pp
177. L.M. Kirousis, E. Kranakis, A survey of concurrent readers and writers. CWI Q. 2, 307-330 (1989)
178. L.M. Kirousis, E. Kranakis, P. Vitányi, Atomic multireader register. Proceedings of the 2nd International Workshop on Distributed Algorithms (WDAG'87), Amsterdam, 1987. LNCS, Vol. 312 (Springer, Berlin, 1987), pp. 278-296
179. A. Kogan, E. Petrank, A methodology for creating fast wait-free data structures. Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'12), New Orleans, 2012 (ACM Press, New York, 2012), pp. 141-150
180. C.P. Kruskal, L. Rudolph, M. Snir, Efficient synchronization on multiprocessors with shared memory. ACM Trans. Program. Lang. Syst. 10(4), 579-601 (1988)
181. A. Kshemkalyani, M. Singhal, Distributed Computing: Principles, Algorithms and Systems (Cambridge University Press, Cambridge, 2008), 736 pp
182. E. Ladam-Mozes, N. Shavit, An optimistic approach to lock-free FIFO queues. Proceedings of the 18th International Symposium on Distributed Computing (DISC'04), Amsterdam, 2004. LNCS, Vol. 3274 (Springer, Heidelberg, 2004), pp. 117-131
183. L. Lamport, A new solution of Dijkstra's concurrent programming problem. Commun. ACM 17(8), 453-455 (1974)
184. L. Lamport, Concurrent reading while writing. Commun. ACM 20(11), 806-811 (1977)
185. L. Lamport, Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng. SE-3(2), 125-143 (1977)
186. L. Lamport, Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558-565 (1978)
187. L. Lamport, How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. C28(9), 690-691 (1979)
188. L. Lamport, The mutual exclusion problem. Part I: a theory of interprocess communication, Part II: statement and solutions. J. ACM 33, 313-348 (1986)
189. L. Lamport, On interprocess communication, Part I: basic formalism. Distrib. Comput. 1(2), 77-85 (1986)
190. L. Lamport, On interprocess communication, Part II: algorithms. Distrib. Comput. 1(2), 77-101 (1986)
191. L. Lamport, Fast mutual exclusion. ACM Trans. Comput. Syst. 5(1), 1-11 (1987)
192. L. Lamport, The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133-169 (1998) (first version appeared as DEC Research, Report #49, September 1989)
193. L. Lamport, Arbitration-free synchronization. Distrib. Comput. 16(2-3), 219-237 (2003)
194. L. Lamport, Teaching concurrency. ACM SIGACT News Distrib. Comput. Column 40(1), 58-62 (2009)
195. J. Larus, Ch. Kozyrakis, Transactional memory: is TM the answer for improving parallel programming? Commun. ACM 51(7), 80-89 (2008)
196. M. Li, J. Tromp, P. Vitányi, How to share concurrent wait-free variables. J. ACM 43(4), 723-746 (1996)
197. W.-K. Lo, V. Hadzilacos, Using failure detectors to solve consensus in asynchronous shared memory systems. Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG'94), 1994. LNCS, Vol. 857 (Springer, Heidelberg, 1994), pp. 280-295
198. W.-K. Lo, V. Hadzilacos, All of us are smarter than any of us: wait-free hierarchies are not robust. Proceedings of the 29th ACM Symposium on Theory of Computing (STOC'97), El Paso, 1997 (ACM Press, New York, 1997), pp. 579-588
199. M. Loui, H. Abu-Amara, Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4, 163-183 (1987). JAI Press
200. V. Luchangco, D. Nussbaum, N. Shavit, A hierarchical CLH queue lock. Proceedings of the 12th European Conference on Parallel Computing (Euro-Par'06), Dresden, 2006. LNCS, Vol. 4128 (Springer, Berlin, 2006), pp. 801-810
201. N.A. Lynch, Distributed Algorithms (Morgan Kaufmann, San Mateo, 1996), 872 pp
202. F. Mattern, Virtual time and global states in distributed computations. ed. by M. Cosnard, P. Quinton, M. Raynal, Y. Robert, Proceedings of the International Workshop on Parallel and Distributed Algorithms, North-Holland, 1989, pp. 215-226
203. K. Mehlhorn, P. Sanders, Algorithms and Data Structures (Springer, Berlin, 2008), 300 pp
204. M. Merritt, G. Taubenfeld, Computing with infinitely many processes. Proceedings of the 14th International Symposium on Distributed Computing (DISC'00), Toledo, 2000. LNCS, Vol. 1914 (Springer, Heidelberg, 2000), pp. 164-178
205. M.M. Michael, M.L. Scott, Simple, fast and practical blocking and non-blocking concurrent queue algorithms. Proceedings of the 15th International ACM Symposium on Principles of Distributed Computing (PODC'96), Philadelphia, 1996 (ACM Press, New York, 1996), pp. 267-275
206. J. Misra, Axioms for memory access in asynchronous hardware systems. ACM Trans. Program. Lang. Syst. 8(1), 142-153 (1986)
207. M. Moir, Practical implementation of non-blocking synchronization primitives. Proceedings of the 16th ACM Symposium on Principles of Distributed Computing (PODC'97), Santa Barbara, 1997 (ACM Press, New York, 1997), pp. 219-228
208. M. Moir, Fast, long-lived renaming improved and simplified. Sci. Comput. Program. 30, 287-308 (1998)
209. M. Moir, J. Anderson, Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Program. 25(1), 1-39 (1995)
210. M. Moir, D. Nussbaum, O. Shalev, N. Shavit, Using elimination to implement scalable and lock-free FIFO queues. Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'05), Las Vegas, 2005 (ACM Press, New York, 2005), pp. 253-262
211. B. Moret, The Theory of Computation (Addison-Wesley, Reading, 1998), 453 pp
212. A. Mostéfaoui, M. Raynal, Solving consensus using Chandra-Toueg's unreliable failure detectors: a general quorum-based approach. Proceedings of the 13th International Symposium on Distributed Computing (DISC'99), Bratislava, 1999. LNCS, Vol. 1693 (Springer, Berlin, 1999), 4963 pp
213. A. Mostéfaoui, M. Raynal, Leader-based consensus. Parallel Process. Lett. 11(1), 95-107 (2001)
214. A. Mostéfaoui, M. Raynal, Looking for efficient implementations of concurrent objects. Proceedings of the 11th International Conference on Parallel Computing Technologies (PaCT'11), Kazan, 2011. LNCS, Vol. 6873 (Springer, Berlin, 2011), pp. 74-87
215. k e)-renaming via k-set agreement. Proceedings of the 20th International Symposium on Distributed Computing (DISC'09), Elche, 2009. LNCS, Vol. 4167 (Springer, Heidelberg, 2006), pp. 1-15
216. A. Mostéfaoui, M. Raynal, C. Travers, From renaming to k-set agreement. 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO'07), Castiglioncello, 2007, LNCS, Vol. 4474 (Springer, Berlin, 2007), pp. 62-76
217. A. Mostéfaoui, M. Raynal, F. Tronel, From binary consensus to multivalued consensus in asynchronous message-passing systems. Inf. Process. Lett. 73, 207-213 (2000)
218. G. Neiger, Failure detectors and the wait-free hierarchy. Proceedings of the 14th ACM Symposium on Principles of Distributed Computing (PODC'95), Ottawa, 1995 (ACM Press, New York, 1995), pp. 100-109
219. R. Newman-Wolfe, A protocol for wait-free atomic multi-reader shared variables. Proceedings of the 6th ACM Symposium on Principles of Distributed Computing (PODC'87), Vancouver, 1987 (ACM Press, New York, 1987), pp. 232-248
220. S. Owicki, D. Gries, Verifying properties of parallel programs. Commun. ACM 19(5), 279-285 (1976)
221. Ch. Papadimitriou, The serializability of concurrent updates. J. ACM 26(4), 631-653 (1979)
222. Ch. Papadimitriou, The Theory of Database Concurrency Control (Computer Science Press, Cambridge, 1988), 239 pp
223. D. Perelman, R. Fan, I. Keidar, On maintaining multiple versions in STM. Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing (PODC'10), Zurich, 2010 (ACM Press, New York, 2010), pp. 16-25
224. G.L. Peterson, Myths about the mutual exclusion problem. Inf. Process. Lett. 12(3), 115-116 (1981)
225. G.L. Peterson, Concurrent reading while writing. ACM Trans. Program. Lang. Syst. 5, 46-55 (1983)
226. G.L. Peterson, R. Bazzi, N. Neiger, A gap theorem for consensus types (extended abstract). Proceedings of the 13th ACM Symposium on Principles of Distributed Computing (PODC'94), Los Angeles, 1994 (ACM Press, New York, 1994), pp. 344-353
227. G.L. Peterson, M.J. Fisher, Economical solutions for the critical section problem in distributed systems. Proceedings of the 9th ACM Symposium on Theory of Computing (STOC'77), Boulder, 1977 (ACM Press, New York, 1977), pp. 91-97
228. S.A. Plotkin, Sticky bits and universality of consensus. Proceedings of the 8th ACM Symposium on Principles of Distributed Computing (PODC'89), Edmonton, 1989 (ACM Press, New York, 1989), pp. 159-176
229. S. Rajsbaum, M. Raynal, A theory-oriented introduction to wait-free synchronization based on the adaptive renaming problem. Proceedings of the 25th International Conference on Advanced Information Networking and Applications (AINA'11), Singapore, 2011 (IEEE Press, New York, 2011), pp. 356-363
230. S. Rajsbaum, M. Raynal, C. Travers, The iterated restricted immediate snapshot model. Proceedings of the 14th Annual International Conference on Computing and Combinatorics (COCOON'08), Dalian, 2008. LNCS, Vol. 5092 (Springer, Heidelberg, 2008), pp. 487-497
231. M. Raynal, Algorithms for Mutual Exclusion (The MIT Press, New York, 1986), 107 pp. ISBN 0-262-18119-3
232. M. Raynal, Sequential consistency as lazy linearizability. Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA'02), Winnipeg, 2002 (ACM Press, New York, 2002), pp. 151-152
233. M. Raynal, Token-based sequential consistency. Int. J. Comput. Syst. Sci. Eng. 17(6), 359-366 (2002)
234. M. Raynal, Reliable compare&swap for fault-tolerant synchronization. Proceedings of the 8th International IEEE Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2003), Guadalajara, 2003 (IEEE Computer Society Press, New York, 2003), pp. 50-55
235. M. Raynal, Failure detectors for asynchronous distributed systems: an introduction. Wiley Encycl. Comput. Sci. Eng. 2, 1181-1191 (2009)
236. M. Raynal, Communication and Agreement Abstractions for Fault-tolerant Asynchronous Distributed Systems (Morgan and Claypool, San Rafael, 2010), 251 pp. ISBN 9781608452934
237. M. Raynal, Fault-tolerant Agreement in Synchronous Distributed Systems (Morgan and Claypool, San Rafael, 2010), 167 pp. ISBN 9781608455256
238. M. Raynal, On the implementation of concurrent objects. Dependable and Historic Computing (Randell's Tales: a Festschrift recognizing the contributions of Brian Randell), LNCS, Vol. 6875 (Springer, Berlin, 2011), pp. 453-478
239. M. Raynal, J. Stainer, From the X and store-collect building blocks to efficient asynchronous consensus. Proceeedings of the 18th International European Parallel Computing Conference (Euro-Par'12), 2012. LNCS, Vol. 7484 (Springer, Berlin, 2012), pp. 427-438
240. M. Raynal, J. Stainer, A simple asynchronous shared memory consensus algorithm based on X and closing sets. Proceedings of the 6th International Conference on Complex, Intelligent, and Software Intensive Systems (CISIS'12), Palermo, 2012 (IEEE Press, New York, 2012), pp. 357-364
241. M. Raynal, G. Thia-Kime, M. Ahamad, From serializable to causal transactions. Brief announcement, Proceedings of the 15th ACM Symposium on Distributed Computing (PODC'96), Philadelphia, 1996 (ACM Press, New York, 1996), 310 pp
242. M. Raynal, C. Travers, In search of the Holy Grail: looking for the weakest failure detector for wait-free set agreement. Proceedings of the 10th International Conference on Principles of Distributed Systems (OPODIS'11), Toulouse, 2006. LNCS, Vol. 4305 (Springer, Heidelberg, 2006), pp. 3-19
243. D.P. Reed, R.K. Kanodia, Synchronization with eventcounts and sequencers. Commun. ACM 22(2), 115-123 (1979)
244. T. Riegel, P. Felber, C. Fetzer, A lazy snapshot algorithm with eager validation. Proceedings of the 20th International Symposium on Distributed Computing (DISC'06), Stockholm, 2006. LNCS, Vol. 4167 (Springer, Heidelberg, 2006), pp. 284-298
245. T. Riegel, C. Fetzer, P. Felber, Time-based transactional memory with scalable time bases. Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'07), San Diego, 2007 (ACM Press, New York, 2007), pp. 221-228
246. P. Robert, J.-P. Verjus, Towards autonomous description of synchronization modules. Proceedings of the IFIP World Congress, Toronto, 1977, pp. 981-986
247. L.R. Sampaio, F.V. Brasileiro, Adaptive indulgent consensus. Proceedings of the 35th International Conference on Dependable Systems and Networks (DSN 2005), 2005 (IEEE Computer Society Press, New York, 2005), pp. 422-431
248. N. Santoro, Design and Analysis of Distributed Algorithms (Wiley, New York, 2007), 589 pp
249. W.N. Scherer III, M.L. Scott, Advanced contention management in dynamic software transactional memory. Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC'05), Las Vegas, 2005 (ACM Press, New York, 2005), pp. 240-248
250. F.B. Schneider, Implementing fault-tolerant services using the state machine approach. ACM Comput. Surv. 22(4), 299-319 (1990)
251. R. Schwarz, F. Mattern, Detecting causal relationship in distributed computations: in search of the Holy Grail. Distrib. Comput. 7, 149-174 (1993)
252. L.M. Scott, Sequential specification of transactional memory semantics. Proceedings of the First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (TRANSACT'06), Ottawa, 2006 (ACM Press, New York, 2006)
253. N. Shafiei, Non-blocking array-based algorithms for stacks and queues. Proceedings of the 10th International Conference on Distributed Computing and Networking (ICDCN'09), Hyderabad, 2009. LNCS, Vol. 5408 (Springer, Heidelberg, 2009), pp. 55-66
254. C. Shao, E. Pierce, J. Welch, Multi-writer consistency conditions for shared memory objects. Proceedings of the 17th International Symposium on Distributed Computing (DISC'03), Sorrento, 2003. LNCS, Vol. 2848 (Springer, Heidelberg, 2003), pp. 106-120
255. N. Shavit, D. Touitou, Software transactional memory. Distrib. Comput. 10(2), 99-116 (1997)
256. E. Shenk, The consensus hierarchy is not robust. Proceedings 16th ACM Symposium on Principles of Distributed Computing (PODC'97), Santa Barbara, 1997 (ACM Press, New York, 1997), p. 279
257. A.K. Singh, J.H. Anderson, M.G. Gouda, The elusive atomic register. J. ACM 41(2), 311-339 (1994)
258. M. Sipser, Introduction to the Theory of Computation (PWS, Boston, 1996), 396 pp
259. M.F. Spear, V.J. Marathe, W.N. Scherer III, M.L. Scott, Conflict detection and validation strategies for software transactional memory. Proceedings of the 20th Symposium on Distributed Computing (DISC'06), Stockholm, 2006. LNCS, Vol. 4167 (Springer, Heidelberg, 2006), pp. 179-193
260. H.S. Stone, Database applications of the fetch&add instruction. IEEE Trans. Comput. C33(7), 604-612 (1984)
261. G. Taubenfeld, The black-white bakery algorithm. Proceedings of the 18th International Symposium on Distributed Computing (DISC'04), Amsterdam, 2004. LNCS, Vol. 3274 (Springer, Heidelberg, 2004), pp. 56-70
262. G. Taubenfeld, Synchronization Algorithms and Concurrent Programming (Pearson Education/Prentice Hall, Upper Saddle River, 2006), 423 pp. ISBN 0-131-97259-6
263. G. Taubenfeld, Contention-sensitive data structure and algorithms. Proceedings of the 23rd International Symposium on Distributed Computing (DISC'09), Elche, 2009. LNCS, Vol. 5805 (Springer, Heidelberg, 2009), pp. 157-171
264. G. Taubenfeld, The computational structure of progress conditions. Proceedings of the 24th International Symposium on Distributed Computing (DISC'10), Cambridge, 2010. LNCS, Vol. 6343 (Springer, Heidelberg, 2010), pp. 221-235
265. J. Tromp, How to construct an atomic variable. Proceedings of the 3rd International Workshop on Distributed Algorithms (WDAG'89), Nice, 1989. LNCS, Vol. 392 (Springer, Heidelberg, 1989), pp. 292-302
266. Ph. Tsigas, Y. Zhang, A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems. Proceedings of the 13th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'01), Heraklion, 2001 (ACM Press, New York), pp. 134-143
267. J.D. Valois, Implementing lock-free queues. Proceedings of the 7th International Conference on Parallel and Distributed Computing Systems (PDCS'94), Las Vegas, 1994 (IEEE Press, New York, 1994), pp. 64-69
268. K. Vidyasankar, Converting Lamport's regular register to atomic register. Inf. Proces. Lett. 30, 221-223 (1989)
269. K. Vidyasankar, Anelegant 1-writer multireader multivalued atomic register. Inf. Proces. Lett. 30(5), 221-223 (1989)
270. K. Vidyasankar, Concurrent reading while writing revisited. Distrib. Comput. 4, 81-85 (1990)
271. K. Vidyasankar, A very simple construction of 1-writer multireader multivalued atomic variable. Inf. Proces. Lett. 37, 323-326 (1991)
272. P. Vitányi, B. Awerbuch, Atomic shared register access by asynchronous hardware. Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (FOCS'87), Los Angeles, 1987 (IEEE Press, New York, 1987), pp. 223-243, 1987 (errata, ibid, 1987)
273. J.-T. Wamhoff, Ch. Fetzer, The universal transactional memory construction. Technical Report, 12 pp, University of Dresden (Germany), 2010
274. W. Wu, J. Cao, J. Yang, M. Raynal, Using asynchrony and zero degradation to speed up indulgent consensus protocols. J. Parallel Distrib. Comput. 68(7), 984-996 (2008)
275. J. Yang, G. Neiger, E. Gafni, Structured derivations of consensus algorithms for failure detectors. Proceedings of the 17th Symposium on Principles of Distributed Computing (PODC), Puerto Vallarta, 1998 (ACM Press, New York, 1998), pp. 297-308