Distributed algorithms for message-passing systems

Distributed Algorithms for Message-Passing Systems

Volumn 9783642381232, Issue , 2013, Pages 1-500

  Raynal, Michel ^a  

^a INSTITUT UNIVERSITAIRE DE FRANCE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EDUCATION; ENGINEERING EDUCATION; MEMORY ARCHITECTURE; MESSAGE PASSING; STUDENTS;

ASYNCHRONOUS COMMUNICATION; COMMUNICATION ABSTRACTION; DESIGN AND IMPLEMENTATIONS; DISTRIBUTED APPLICATIONS; DISTRIBUTED GRAPH ALGORITHMS; DISTRIBUTED SHARED MEMORY; MESSAGE PASSING SYSTEMS; UNDERGRADUATE STUDENTS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84929852603     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-642-38123-2     Document Type: Book

References (396)

1. A. Acharya, B. R. Badrinath, Recording distributed snapshot based on causal order of message delivery. Inf. Process. Lett. 44, 317-321 (1992)
2. A. Acharya, B. R. Badrinath, Checkpointing distributed application on mobile computers, in 3rd Int'l Conference on Parallel and Distributed Information Systems (IEEE Press, New York, 1994), pp. 73-80
3. S. Adve, K. Gharachorloo, Shared memory consistency models. IEEE Comput. 29(12), 66-76 (1996)
4. S. Adve, M. Mill, A unified formalization of four shared memory models. IEEE Trans. Parallel Distrib. Syst. 4(6), 613-624 (1993)
5. Y. Afek, G. M. Brown, M. Merritt, Lazy caching. ACM Trans. Program. Lang. Syst. 15(1), 182-205 (1993)
6. A. Agarwal, V. K. Garg, Efficient dependency tracking for relevant events in concurrent systems. Distrib. Comput. 19(3), 163-183 (2007)
7. D. Agrawal, A. El Abbadi, An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Trans. Comput. Syst. 9(1), 1-20 (1991)
8. D. Agrawal, A. Malpini, Efficient dissemination of information in computer networks. Comput. J. 34(6), 534-541 (1991)
9. M. Ahamad, M. H. Ammar, S. Y. Cheung, Multidimensional voting. ACM Trans. Comput. Syst. 9(4), 399-431 (1991)
10. M. Ahamad, G. Neiger, J. E. Burns, P. W. Hutto, P. Kohli, Causal memory: definitions, implementation and programming. Distrib. Comput. 9, 37-49 (1995)
11. M. Ahamad, M. Raynal, G. Thia-Kime, An adaptive protocol for implementing causally consistent distributed services, in Proc. 18th Int'l Conference on Distributed Computing Systems (ICDCS'98) (IEEE Press, New York, 1998), pp. 86-93
12. M. Ahuja, Flush primitives for asynchronous distributed systems. Inf. Process. Lett. 34, 5-12 (1990)
13. M. Ahuja, M. Raynal, An implementation of global flush primitives using counters. Parallel Process. Lett. 5(2), 171-178 (1995)
14. S. Alagar, S. Venkatesan, An optimal algorithm for distributed snapshots with message causal ordering. Inf. Process. Lett. 50, 310-316 (1994)
15. A. Alvarez, S. Arévalo, V. Cholvi, A. Fernández, E. Jiménez, On the interconnection of message passing systems. Inf. Process. Lett. 105(6), 249-254 (2008)
16. L. Alvisi, K. Marzullo, Message logging: pessimistic, optimistic, and causal. IEEE Trans. Softw. Eng. 24(2), 149-159 (1998)
17. E. Anceaume, J.-M. Hélary, M. Raynal, Tracking immediate predecessors in distributed computations, in Proc. 14th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'002) (ACM Press, New York, 2002), pp. 210-219
18. E. Anceaume, J.-M. Hélary, M. Raynal, A note on the determination of the immediate predecessors in a distributed computation. Int. J. Found. Comput. Sci. 13(6), 865-872 (2002)
19. D. Angluin, Local and global properties in networks of processors, in Proc. 12th ACM Symposium on Theory of Computation (STOC'81) (ACM Press, New York, 1981), pp. 82-93
20. I. Arrieta, F. Fariña, J.-R. Mendívil, M. Raynal, Leader election: from Higham-Przytycka's algorithm to a gracefully degrading algorithm, in Proc. 6th Int'l Conference on Complex, Intelligent, and Software Intensive Systems (CISIS'12) (IEEE Press, New York, 2012), pp. 225-232
21. H. Attiya, S. Chaudhuri, R. Friedman, J. L. Welch, Non-sequential consistency conditions for shared memory, in Proc. 5th ACM Symposium on Parallel Algorithms and Architectures (SPAA'93) (ACM Press, New York, 1993), pp. 241-250
22. H. Attiya, M. Snir, M. Warmuth, Computing on an anonymous ring. J. ACM 35(4), 845-876 (1988)
23. H. Attiya, J. L. Welch, Sequential consistency versus linearizability. ACM Trans. Comput. Syst. 12(2), 91-122 (1994)
24. H. Attiya, J. L. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. (Wiley-Interscience, New York, 2004). 414 pages. ISBN 0-471-45324-2
25. B. Awerbuch, A new distributed depth-first search algorithm. Inf. Process. Lett. 20(3), 147-150 (1985)
26. B. Awerbuch, Reducing complexities of the distributed max-flow and breadth-first algorithms by means of network synchronization. Networks 15, 425-437 (1985)
27. B. Awerbuch, Complexity of network synchronization. J. ACM 4, 804-823 (1985)
28. O. Babaoʇlu, E. Fromentin, M. Raynal, A unified framework for the specification and the run-time detection of dynamic properties in distributed executions. J. Syst. Softw. 33, 287-298 (1996)
29. O. Babaoʇlu, K. Marzullo, Consistent global states of distributed systems: fundamental concepts and mechanisms, in Distributed Systems (ACM/Addison-Wesley Press, New York, 1993), pp. 55-93. Chap. 4
30. R. Bagrodia, Process synchronization: design and performance evaluation for distributed algorithms. IEEE Trans. Softw. Eng. SE15(9), 1053-1065 (1989)
31. R. Bagrodia, Synchronization of asynchronous processes in CSP. ACM Trans. Program. Lang. Syst. 11(4), 585-597 (1989)
32. H. E. Bal, F. Kaashoek, A. Tanenbaum, Orca: a language for parallel programming of distributed systems. IEEE Trans. Softw. Eng. 18(3), 180-205 (1992)
33. R. Baldoni, J. M. Hélary, A. Mostéfaoui, M. Raynal, Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property. Inf. Process. Lett. 80(2), 105-111 (2001)
34. R. Baldoni, J. M. Hélary, A. Mostéfaoui, M. Raynal, A communication-induced checkpointing protocol that ensures rollback-dependency trackability, in Proc. 27th IEEE Symposium on Fault-Tolerant Computing (FTCS-27) (IEEE Press, New York, 1997), pp. 68-77
35. R. Baldoni, J.-M. Hélary, M. Raynal, Consistent records in asynchronous computations. Acta Inform. 35(6), 441-455 (1998)
36. R. Baldoni, J. M. Hélary, M. Raynal, Rollback-dependency trackability: a minimal characterization and its protocol. Inf. Comput. 165(2), 144-173 (2001)
37. R. Baldoni, G. Melideo, k-dependency vectors: a scalable causality-tracking protocol, in Proc. 11th Euromicro Workshop on Parallel, Distributed and Network-Based Processing (PDP'03) (2003), pp. 219-226
38. R. Baldoni, A. Mostéfaoui, M. Raynal, Causal delivery of messages with real-time data in unreliable networks. Real-Time Syst. 10(3), 245-262 (1996)
39. R. Baldoni, R. Prakash, M. Raynal, M. Singhal, Efficient delta-causal broadcasting. Comput. Syst. Sci. Eng. 13(5), 263-270 (1998)
40. R. Baldoni, M. Raynal, Fundamentals of distributed computing: a practical tour of vector clock systems. IEEE Distrib. Syst. Online 3(2), 1-18 (2002)
41. D. Barbara, H. Garcia Molina, Mutual exclusion in partitioned distributed systems. Distrib. Comput. 1(2), 119-132 (1986)
42. D. Barbara, H. Garcia Molina, A. Spauster, Increasing availability under mutual exclusion constraints with dynamic vote assignments. ACM Trans. Comput. Syst. 7(7), 394-426 (1989)
43. L. Barenboim, M. Elkin, Deterministic distributed vertex coloring in polylogarithmic time. J. ACM 58(5), 23(2011), 25 pages
44. R. Bellman, Dynamic Programming (Princeton University Press, Princeton, 1957)
45. J.-C. Bermond, C. Delorme, J.-J. Quisquater, Strategies for interconnection networks: some methods from graph theory. J. Parallel Distrib. Comput. 3(4), 433-449 (1986)
46. J.-C. Bermond, J.-C. König, General and efficient decentralized consensus protocols II, in Proc. Int'l Workshop on Parallel and Distributed Algorithms, ed. by M. Cosnard, P. Quinton, M. Raynal, Y. Robert (North-Holland, Amsterdam, 1989), pp. 199-210
47. J.-C. Bermond, J.-C. König, Un protocole distribué pour la 2-connexité. TSI. Tech. Sci. Inform. 10(4), 269-274 (1991)
48. J.-C. Bermond, J.-C. König, M. Raynal, General and efficient decentralized consensus protocols, in Proc. 2nd Int'l Workshop on Distributed Algorithms (WDAG'87). LNCS, vol. 312 (Springer, Berlin, 1987), pp. 41-56
49. J.-C. Bermond, C. Peyrat, de Bruijn and Kautz networks: a competitor for the hypercube? in Proc. Int'l Conference on Hypercube and Distributed Computers (North-Holland, Amsterdam, 1989), pp. 279-284
50. J. M. Bernabéu-Aubán, M. Ahamad, Applying a path-compression technique to obtain an effective distributed mutual exclusion algorithm, in Proc. 3rd Int'l Workshop on Distributed Algorithms (WDAG'89). LNCS, vol. 392 (Springer, Berlin, 1989), pp. 33-44
51. A. J. Bernstein, Output guards and non-determinism in "communicating sequential processes". ACM Trans. Program. Lang. Syst. 2(2), 234-238 (1980)
52. B. K. Bhargava, S.-R. Lian, Independent checkpointing and concurrent rollback for recovery in distributed systems: an optimistic approach, in Proc. 7th IEEE Symposium on Reliable Distributed Systems (SRDS'88) (IEEE Press, New York, 1988), pp. 3-12
53. K. Birman, T. Joseph, Reliable communication in the presence of failures. ACM Trans. Comput. Syst. 5(1), 47-76 (1987)
54. A. D. Birell, B. J. Nelson, Implementing remote procedure calls. ACM Trans. Comput. Syst. 3, 39-59 (1984)
55. K. P. Birman, A. Schiper, P. Stephenson, Lightweight causal and atomic group multicast. ACM Trans. Comput. Syst. 9(3), 272-314 (1991)
56. H. L. Bodlaender, Some lower bound results for decentralized extrema finding in ring of processors. J. Comput. Syst. Sci. 42, 97-118 (1991)
57. L. Bougé, Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP. Theor. Comput. Sci. 49, 145-169 (1987)
58. L. Bougé, N. Francez, A compositional approach to super-imposition, in Proc. 15th Annual ACM Symposium on Principles of Programming Languages (POPL'88) (ACM Press, New York, 1988), pp. 240-249
59. A. Boukerche, C. Tropper, A distributed graph algorithm for the detection of local cycles and knots. IEEE Trans. Parallel Distrib. Syst. 9(8), 748-757 (1998)
60. Ch. Boulinier, F. Petit, V. Villain, Synchronous vs asynchronous unison. Algorithmica 51(1), 61-80 (2008)
61. G. Bracha, S. Toueg, Distributed deadlock detection. Distrib. Comput. 2(3), 127-138 (1987)
62. D. Briatico, A. Ciuffoletti, L. A. Simoncini, Distributed domino-effect free recovery algorithm, in 4th IEEE Symposium on Reliability in Distributed Software and Database Systems (IEEE Press, New York, 1984), pp. 207-215
63. P. Brinch Hansen, Distributed processes: a concurrent programming concept. Commun. ACM 21(11), 934-941 (1978)
64. J. Brzezinski, J.-M. Hélary, M. Raynal, Termination detection in a very general distributed computing model, in Proc. 13th IEEE Int'l Conference on Distributed Computing Systems (ICDCS'93) (IEEE Press, New York, 1993), pp. 374-381
65. J. Brzezinski, J.-M. Hélary, M. Raynal, M. Singhal, Deadlock models and a general algorithm for distributed deadlock detection. J. Parallel Distrib. Comput. 31(2), 112-125 (1995)
66. (Erratum printed in Journal of Parallel and Distributed Computing, 32(2), 232 (1996))
67. G. N. Buckley, A. Silberschatz, An effective implementation for the generalized input-output construct of CSP. ACM Trans. Program. Lang. Syst. 5(2), 223-235 (1983)
68. C. Cachin, R. Guerraoui, L. Rodrigues, Introduction to Reliable and Secure Distributed Programming, 2nd edn. (Springer, Berlin, 2012), 367 pages. ISBN 978-3-642-15259-7
69. G. Cao, M. Singhal, A delay-optimal quorum-based mutual exclusion algorithm for distributed systems. IEEE Trans. Parallel Distrib. Syst. 12(12), 1256-1268 (1991)
70. N. Carriero, D. Gelernter, T. G. Mattson, A. H. Sherman, The Linda alternative to messagepassing systems. Parallel Comput. 20(4), 633-655 (1994)
71. O. Carvalho, G. Roucairol, On the distribution of an assertion, in Proc. First ACM Symposium on Principles of Distributed Computing (PODC'1982) (ACM Press, New York, 1982), pp. 18-20
72. O. Carvalho, G. Roucairol, On mutual exclusion in computer networks. Commun. ACM 26(2), 146-147 (1983)
73. L. M. Censier, P. Feautrier, A new solution to coherence problems in multicache systems. IEEE Trans. Comput. C-27(12), 112-118 (1978)
74. P. Chandra, A. K. Kshemkalyani, Causality-based predicate detection across space and time. IEEE Trans. Comput. 54(11), 1438-1453 (2005)
75. S. Chandrasekaran, S. Venkatesan, A message-optimal algorithm for distributed termination detection. J. Parallel Distrib. Comput. 8(3), 245-252 (1990)
76. K. M. Chandy, L. Lamport, Distributed snapshots: determining global states of distributed systems. ACM Trans. Comput. Syst. 3(1), 63-75 (1985)
77. K. M. Chandy, J. Misra, Deadlock absence proof for networks of communicating processes. Inf. Process. Lett. 9(4), 185-189 (1979)
78. K. M. Chandy, J. Misra, Distributed computation on graphs: shortest path algorithms. Commun. ACM 25(11), 833-837 (1982)
79. K. M. Chandy, J. Misra, The drinking philosophers problem. ACM Trans. Program. Lang. Syst. 6(4), 632-646 (1984)
80. K. M. Chandy, J. Misra, An example of stepwise refinement of distributed programs: quiescence detection. ACM Trans. Program. Lang. Syst. 8(3), 326-343 (1986)
81. K. M. Chandy, J. Misra, Parallel Program Design (Addison-Wesley, Reading, 1988), 516 pages
82. K. M. Chandy, J. Misra, L. M. Haas, Distributed deadlock detection. ACM Trans. Comput. Syst. 1(2), 144-156 (1983)
83. E. J. H. Chang, Echo algorithms: depth-first algorithms on graphs. IEEE Trans. Softw. Eng. SE-8(4), 391-402 (1982)
84. E. J. H. Chang, R. Roberts, An improved algorithm for decentralized extrema finding in circular configurations of processes. Commun. ACM 22(5), 281-283 (1979)
85. J.-M. Chang, N. F. Maxemchuck, Reliable broadcast protocols. ACM Trans. Comput. Syst. 2(3), 251-273 (1984)
86. A. Charlesworth, The multiway rendezvous. ACM Trans. Program. Lang. Syst. 9, 350-366 (1987)
87. B. Charron-Bost, Concerning the size of logical clocks in distributed systems. Inf. Process. Lett. 39, 11-16 (1991)
88. B. Charron-Bost, G. Tel, Calcul approché de la borne inférieure de valeurs réparties. Inform. Théor. Appl. 31(4), 305-330 (1997)
89. B. Charron-Bost, G. Tel, F. Mattern, Synchronous, asynchronous, and causally ordered communications. Distrib. Comput. 9(4), 173-191 (1996)
90. C. Chase, V. K. Garg, Detection of global predicates: techniques and their limitations. Distrib. Comput. 11(4), 191-201 (1998)
91. D. R. Cheriton, D. Skeen, Understanding the limitations of causally and totally ordered communication, in Proc. 14th ACM Symposium on Operating System Principles (SOSP'93) (ACM Press, New York, 1993), pp. 44-57
92. T.-Y. Cheung, Graph traversal techniques and the maximum flow problem in distributed computation. IEEE Trans. Softw. Eng. SE-9(4), 504-512 (1983)
93. V. Cholvi, A. Fernández, E. Jiménez, P. Manzano, M. Raynal, A methodological construction of an efficient sequentially consistent distributed shared memory. Comput. J. 53(9), 1523-1534 (2010)
94. C. T. Chou, I. Cidon, I. Gopal, S. Zaks, Synchronizing asynchronous bounded delays networks, in Proc. 2nd Int'l Workshop on Distributed Algorithms (WDAG'87). LNCS, vol. 312 (Springer, Berlin, 1987), pp. 212-218
95. M. Choy, A. K. Singh, Efficient implementation of synchronous communication over asynchronous networks. J. Parallel Distrib. Comput. 26, 166-180 (1995)
96. I. Cidon, Yet another distributed depth-first search algorithm. Inf. Process. Lett. 26(6), 301-305 (1988)
97. I. Cidon, An efficient knot detection algorithm. IEEE Trans. Softw. Eng. 15(5), 644-649 (1989)
98. E. G. Coffman Jr., M. J. Elphick, A. Shoshani, System deadlocks. ACM Comput. Surv. 3(2), 67-78 (1971)
99. R. Cooper, K. Marzullo, Consistent detection of global predicates, in Proc. ACM/ONR Workshop on Parallel and Distributed Debugging (ACM Press, New York, 1991), pp. 163-173
100. Th. H. Cormen, Ch. E. Leiserson, R. L. Rivest, Introduction to Algorithms (The MIT Press, Cambridge, 1998), 1028 pages
101. J.-M. Couvreur, N. Francez, M. Gouda, Asynchronous unison, in Proc. 12th IEEE Int'l Conference on Distributed Computing Systems (ICDCS'92) (IEEE Press, New York, 1992), pp. 486-493
102. F. Cristian, Probabilistic clock synchronization. Distrib. Comput. 3(3), 146-158 (1989)
103. F. Cristian, H. Aghili, R. Strong, D. Dolev, Atomic broadcast: from simple message diffusion to Byzantine agreement. Inf. Comput. 118(1), 158-179 (1995)
104. F. Cristian, F. Jahanian, A timestamping-based checkpointing protocol for long-lived distributed computations, in Proc. 10th IEEE Symposium on Reliable Distributed Systems (SRDS'91) (IEEE Press, New York, 1991), pp. 12-20
105. O. P. Damani, Y.-M. Wang, V. K. Garg, Distributed recovery with k-optimistic logging. J. Parallel Distrib. Comput. 63(12), 1193-1218 (2003)
106. M. J. Demmer, M. Herlihy, The arrow distributed directory protocol, in Proc. 12th Int'l Symposium on Distributed Computing (DISC'98). LNCS, vol. 1499 (Springer, Berlin, 1998), pp. 119-133
107. P. J. Denning, Virtual memory. ACM Comput. Surv. 2(3), 153-189 (1970)
108. P. J. Denning, J. B. Dennis, J. E. Qualitz, Machines, Languages and Computation (Prentice Hall, New York, 1978), 612 pages
109. Cl. Diehl, Cl. Jard, Interval approximations of message causality in distributed executions, in Proc. 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS'92). LNCS, vol. 577 (Springer, Berlin, 1992 pp. 363-374
110. E. W. Dijkstra, Solution of a problem in concurrent programming control. Commun. ACM 8(9), 569 (1965)
111. E. W. Dijkstra, The structure of "THE" multiprogramming system. Commun. ACM 11(5), 341-346 (1968)
112. E. W. Dijkstra, Hierarchical ordering of sequential processes. Acta Inform. 1, 115-138 (1971)
113. E. W. Dijkstra, Self stabilizing systems in spite of distributed control. Commun. ACM 17, 643-644 (1974)
114. E. W. Dijkstra, Guarded commands, nondeterminacy, and formal derivation of programs. Commun. ACM 18(8), 453-457 (1979)
115. E. W. Dijkstra, W. H. J. Feijen, A. J. M. Van Gasteren, Derivation of a termination detection algorithm for distributed computations. Inf. Process. Lett. 16(5), 217-219 (1983)
116. E. W. D. Dijkstra, C. S. Scholten, Termination detection for diffusing computations. Inf. Process. Lett. 11(1), 1-4 (1980)
117. D. Dolev, J. Y. Halpern, H. R. Strong, On the possibility and impossibility of achieving clock synchronization. J. Comput. Syst. Sci. 33(2), 230-250 (1986)
118. D. Dolev, M. Klawe, M. Rodeh, An O (n logn) unidirectional distributed algorithm for extrema finding in a circle. J. Algorithms 3, 245-260 (1982)
119. S. Dolev, Self-Stabilization (The MIT Press, Cambridge, 2000), 197 pages
120. M. Dubois, C. Scheurich, Memory access dependencies in shared memory multiprocessors. IEEE Trans. Softw. Eng. 16(6), 660-673 (1990)
121. E. N. Elnozahy, L. Alvisi, Y.-M. Wang, D. B. Johnson, A survey of rollback-recovery protocols in message-passing systems. ACM Comput. Surv. 34(3), 375-408 (2002)
122. E. Evangelist, N. Francez, S. Katz, Multiparty interactions for interprocess communication and synchronization. IEEE Trans. Softw. Eng. 15(11), 1417-1426 (1989)
123. S. Even, Graph Algorithms, 2nd edn. (Cambridge University Press, Cambridge, 2011), 202 pages (edited by G. Even)
124. A. Fekete, N. A. Lynch, L. Shrira, A modular proof of correctness for a network synchronizer, in Proc. 2nd Int'l Workshop on Distributed Algorithms (WDAG'87). LNCS, vol. 312 (Springer, Berlin, 1987), pp. 219-256
125. C. J. Fidge, Timestamp in message passing systems that preserves partial ordering, in Proc. 11th Australian Computing Conference (1988), pp. 56-66
126. C. J. Fidge, Logical time in distributed computing systems. IEEE Comput. 24(8), 28-33 (1991)
127. C. J. Fidge, Limitation of vector timestamps for reconstructing distributed computations. Inf. Process. Lett. 68, 87-91 (1998)
128. M. J. Fischer, A. Michael, Sacrificing serializability to attain high availability of data, in Proc. First ACM Symposium on Principles of Database Systems (PODS'82) (ACM Press, New York, 1882), pp. 70-75
129. R. W. Floyd, Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)
130. J. Fowler, W. Zwaenepoel, Causal distributed breakpoints, in Proc. 10th Int'l IEEE Conference on Distributed Computing Systems (ICDCS'90) (IEEE Press, New York, 1990), pp. 134-141
131. N. Francez, Distributed termination. ACM Trans. Program. Lang. Syst. 2(1), 42-55 (1980)
132. N. Francez, B. Halpern, G. Taubenfeld, Script: a communication abstraction mechanism. Sci. Comput. Program. 6(1), 35-88 (1986)
133. N. Francez, M. Rodeh, Achieving distributed termination without freezing. IEEE Trans. Softw. Eng. 8(3), 287-292 (1982)
134. N. Francez, S. Yemini, Symmetric intertask communication. ACM Trans. Program. Lang. Syst. 7(4), 622-636 (1985)
135. W. R. Franklin, On an improved algorithm for decentralized extrema-finding in circular configurations of processors. Commun. ACM 25(5), 336-337 (1982)
136. U. Fridzke, P. Ingels, A. Mostéfaoui, M. Raynal, Fault-tolerant consensus-based total order multicast. IEEE Trans. Parallel Distrib. Syst. 13(2), 147-157 (2001)
137. R. Friedman, Implementing hybrid consistency with high-level synchronization operations, in Proc. 12th Annual ACM Symposium on Principles of Distributed Computing (PODC'93) (ACM Press, New York, 1993), pp. 229-240
138. E. Fromentin, Cl. Jard, G.-V. Jourdan, M. Raynal, On-the-fly analysis of distributed computations. Inf. Process. Lett. 54(5), 267-274 (1995)
139. E. Fromentin, M. Raynal, Shared global states in distributed computations. J. Comput. Syst. Sci. 55(3), 522-528 (1997)
140. E. Fromentin, M. Raynal, V. K. Garg, A. I. Tomlinson, On the fly testing of regular patterns in distributed computations, in Proc. Int'l Conference on Parallel Processing (ICPP'94) (1994), pp. 73-76
141. R. Fujimoto, Parallel discrete event simulation. Commun. ACM 33(10), 31-53 (1990)
142. E. Gafni, D. Bertsekas, Distributed algorithms for generating loop-free routes in networks with frequently changing topologies. IEEE Trans. Commun. C-29(1), 11-18 (1981)
143. R. G. Gallager, Distributed minimum hop algorithms. Tech Report LIDS 1175, MIT, 1982
144. R. G. Gallager, P. A. Humblet, P. M. Spira, A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5(1), 66-77 (1983)
145. I. C. Garcia, E. Buzato, Progressive construction of consistent global checkpoints, in Proc. 19th Int'l Conference on Distributed Computing Systems (ICDCS'99) (IEEE Press, New York, 1999), pp. 55-62
146. I. C. Garcia, L. E. Buzato, On the minimal characterization of the rollback-dependency trackability property, in Proc. 21st Int'l Conference on Distributed Computing Systems (ICDCS'01) (IEEE Press, New York, 2001), pp. 342-349
147. I. C. Garcia, L. E. Buzato, An efficient checkpointing protocol for the minimal characterization of operational rollback-dependency trackability, in Proc. 23rd Int'l Symposium on Reliable Distributed Systems (SRDS'04) (IEEE Press, New York, 2004), pp. 126-135
148. H. Garcia Molina, D. Barbara, How to assign votes in a distributed system. J. ACM 32(4), 841-860 (1985)
149. M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979), 340 pages
150. V. K. Garg, Principles of Distributed Systems (Kluwer Academic, Dordrecht, 1996), 274 pages
151. V. K. Garg, Elements of Distributed Computing (Wiley-Interscience, New York, 2002), 423 pages
152. V. K. Garg, M. Raynal, Normality: a consistency condition for concurrent objects. Parallel Process. Lett. 9(1), 123-134 (1999)
153. V. K. Garg, S. Skawratananond, N. Mittal, Timestamping messages and events in a distributed system using synchronous communication. Distrib. Comput. 19(5-6), 387-402 (2007)
154. V. K. Garg, B. Waldecker, Detection of weak unstable predicates in distributed programs. IEEE Trans. Parallel Distrib. Syst. 5(3), 299-307 (1994)
155. V. K. Garg, B. Waldecker, Detection of strong unstable predicates in distributed programs. IEEE Trans. Parallel Distrib. Syst. 7(12), 1323-1333 (1996)
156. Ch. Georgiou, A. Shvartsman, Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity (Springer, Berlin, 2008), 219 pages. ISBN 978-0-387-69045-2
157. K. Gharachorloo, P. Gibbons, Detecting violations of sequential consistency, in Proc. 3rd ACM Symposium on Parallel Algorithms and Architectures (SPAA'91) (ACM Press, New York, 1991), pp. 316-326
158. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, J. L. Hennessy, Memory consistency and event ordering in scalable shared memory multiprocessors, in Proc. 17th ACM Int'l Symposium on Computer Architecture (ISCA'90) (1990), pp. 15-26
159. A. Gibbons, Algorithmic Graph Theory (Cambridge University Press, Cambridge, 1985), 260 pages
160. D. K. Gifford, Weighted voting for replicated data, in Proc. 7th ACM Symposium on Operating System Principles (SOSP'79) (ACM Press, New York, 1979), pp. 150-172
161. V. D. Gligor, S. H. Shattuck, Deadlock detection in distributed systems. IEEE Trans. Softw. Eng. SE-6(5), 435-440 (1980)
162. A. P. Goldberg, A. Gopal, A. Lowry, R. Strom, Restoring consistent global states of distributed computations, in Proc. ACM/ONR Workshop on Parallel and Distributed Debugging (ACM Press, New York, 1991), pp. 144-156
163. M. Gouda, T. Herman, Stabilizing unison. Inf. Process. Lett. 35(4), 171-175 (1990)
164. D. Gray, A. Reuter, Transaction Processing: Concepts and Techniques (Morgan Kaufmann, San Mateo, 1993), 1060 pages. ISBN 1-55860-190-2
165. J. L. Gross, J. Yellen (eds.), Graph Theory (CRC Press, Boca Raton, 2004), 1167 pages
166. H. N. Haberman, Prevention of system deadlocks. Commun. ACM 12(7), 373-377 (1969)
167. J. W. Havender, Avoiding deadlocks in multitasking systems. IBM Syst. J. 13(3), 168-192 (1971)
168. J.-M. Hélary, Observing global states of asynchronous distributed applications, in Proc. 3rd Int'l Workshop on Distributed Algorithms (WDAG'87). LNCS, vol. 392 (Springer, Berlin, 1987), pp. 124-135
169. J.-M. Hélary, M. Hurfin, A. Mostéfaoui, M. Raynal, F. Tronel, Computing global functions in asynchronous distributed systems with perfect failure detectors. IEEE Trans. Parallel Distrib. Syst. 11(9), 897-909 (2000)
170. J.-M. Hélary, C. Jard, N. Plouzeau, M. Raynal, Detection of stable properties in distributed systems, in Proc. 6th ACM Symposium on Principles of Distributed Computing (PODC'87) (ACM Press, New York, 1987), pp. 125-136
171. J.-M. Hélary, A. Maddi, M. Raynal, Controlling information transfers in distributed applications, application to deadlock detection, in Proc. Int'l IFIP WG 10.3 Conference on Parallel Processing (North-Holland, Amsterdam, 1987), pp. 85-92
172. J.-M. Hélary, A. Mostéfaoui, R. H. B. Netzer, M. Raynal, Communication-based prevention of useless checkpoints in distributed computations. Distrib. Comput. 13(1), 29-43 (2000)
173. J.-M. Hélary, A. Mostéfaoui, M. Raynal, A general scheme for token and tree-based distributed mutual exclusion algorithms. IEEE Trans. Parallel Distrib. Syst. 5(11), 1185-1196 (1994)
174. J.-M. Hélary, A. Mostéfaoui, M. Raynal, Communication-induced determination of consistent snapshots. IEEE Trans. Parallel Distrib. Syst. 10(9), 865-877 (1999)
175. J.-M. Hélary, A. Mostéfaoui, M. Raynal, Interval consistency of asynchronous distributed computations. J. Comput. Syst. Sci. 64(2), 329-349 (2002)
176. J.-M. Hélary, R. H. B. Netzer, M. Raynal, Consistency criteria for distributed checkpoints. IEEE Trans. Softw. Eng. 2(2), 274-281 (1999)
177. J.-M. Hélary, N. Plouzeau, M. Raynal, A distributed algorithm for mutual exclusion in arbitrary networks. Comput. J. 31(4), 289-295 (1988)
178. J.-M. Hélary, M. Raynal, Depth-first traversal and virtual ring construction in distributed systems, in Proc. IFIP WG 10.3 Conference on Parallel Processing (North-Holland, Amsterdam, 1988), pp. 333-346
179. J.-M. Hélary, M. Raynal, Vers la construction raisonnée d'algorithmes répartis: le cas de la terminaison. TSI. Tech. Sci. Inform. 10(3), 203-209 (1991)
180. J.-M. Hélary, M. Raynal, Synchronization and Control of Distributed Systems and Programs (Wiley, New York, 1991), 160 pages
181. J.-M. Hélary, M. Raynal, Towards the construction of distributed detection programs with an application to distributed termination. Distrib. Comput. 7(3), 137-147 (1994)
182. J.-M. Hélary, M. Raynal, G. Melideo, R. Baldoni, Efficient causality-tracking timestamping. IEEE Trans. Knowl. Data Eng. 15(5), 1239-1250 (2003)
183. M. Herlihy, F. Kuhn, S. Tirthapura, R. Wattenhofer, Dynamic analysis of the arrow distributed protocol. Theory Comput. Syst. 39(6), 875-901 (2006)
184. M. Herlihy, J. Wing, Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463-492 (1990)
185. L. Higham, T. Przytycka, A simple efficient algorithm for maximum finding on rings. Inf. Process. Lett. 58(6), 319-324 (1996)
186. D. S. Hirschberg, J. B. Sinclair, Decentralized extrema finding in circular configuration of processors. Commun. ACM 23, 627-628 (1980)
187. C. A. R. Hoare, Communicating sequential processes. Commun. ACM 21(8), 666-677 (1978)
188. W. Hohberg, How to find biconnected components in distributed networks. J. Parallel Distrib. Comput. 9(4), 374-386 (1990)
189. R. C. Holt, Comments on prevention of system deadlocks. Commun. ACM 14(1), 36-38 (1871)
190. J. E. Hopcroft, R. Motwani, J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 2nd edn. (Addison-Wesley, Reading, 2001), 521 pages
191. S.-T. Huang, Termination detection by using distributed snapshots. Inf. Process. Lett. 32(3), 113-119 (1989)
192. S.-T. Huang, Detecting termination of distributed computations by external agents, in Proc. 9th IEEE Int'l Conference on Distributed Computing Systems (ICDCS'89) (IEEE Press, New York, 1989), pp. 79-84
193. M. Hurfin, N. Plouzeau, M. Raynal, Detecting atomic sequences of predicates in distributed computations. SIGPLAN Not. 28(12), 32-42 (1993). Proc. ACM/ONR Workshop on Parallel and Distributed Debugging
194. M. Hurfin, M. Mizuno, M. Raynal, S. Singhal, Efficient distributed detection of conjunctions of local predicates. IEEE Trans. Softw. Eng. 24(8), 664-677 (1998)
195. P. Hutto, M. Ahamad, Slow memory: weakening consistency to enhance concurrency in distributed shared memories, in Proc. 10th IEEE Int'l Conference on Distributed Computing Systems (ICDCS'90) (IEEE Press, New York, 1990), pp. 302-311
196. T. Ibaraki, T. Kameda, A theory of coteries: mutual exclusion in distributed systems. J. Parallel Distrib. Comput. 4(7), 779-794 (1993)
197. T. Ibaraki, T. Kameda, T. Minoura, Serializability with constraints. ACM Trans. Database Syst. 12(3), 429-452 (1987)
198. R. Ingram, P. Shields, J. E. Walter, J. L. Welch, An asynchronous leader election algorithm for dynamic networks, in Proc. 23rd Int'l IEEE Parallel and Distributed Processing Symposium (IPDPS'09) (IEEE Press, New York, 2009), pp. 1-12
199. Cl. Jard, G.-V. Jourdan, Incremental transitive dependency tracking in distributed computations. Parallel Process. Lett. 6(3), 427-435 (1996)
200. J. Jefferson, Virtual time. ACM Trans. Program. Lang. Syst. 7(3), 404-425 (1985)
201. E. Jiménez, A. Fernández, V. Cholvi, A parameterized algorithm that implements sequential, causal, and cache memory consistencies. J. Syst. Softw. 81(1), 120-131 (2008)
202. Ö. Johansson, Simple distributed (A + 1)-coloring of graphs. Inf. Process. Lett. 70(5), 229-232 (1999)
203. D. B. Johnson, W Zwaenepoel, Recovery in distributed systems using optimistic message logging and checkpointing. J. Algorithms 11(3), 462-491 (1990)
204. S. Kanchi, D. Vineyard, An optimal distributed algorithm for all-pairs shortest-path. Int. J. Inf. Theories Appl. 11(2), 141-146 (2004)
205. P. Keleher, A. L. Cox, W Zwaenepoel, Lazy release consistency for software distributed shared memory, in Proc. 19th ACM Int'l Symposium on Computer Architecture (ISCA'92), (1992), pp. 13-21
206. J. Kleinberg, E. Tardos, Algorithm Design (Addison-Wesley, Reading, 2005), 838 pages
207. P. Knapp, Deadlock detection in distributed databases. ACM Comput. Surv. 19(4), 303-328 (1987)
208. R. Koo, S. Toueg, Checkpointing and rollback-recovery for distributed systems. IEEE Trans. Softw. Eng. 13(1), 23-31 (1987)
209. E. Korach, S. Moran, S. Zaks, Tight lower and upper bounds for some distributed algorithms for a complete network of processors, in Proc. 4th ACM Symposium on Principles of Distributed Computing (PODC'84) (ACM Press, New York, 1984), pp. 199-207
210. E. Korach, S. Moran, S. Zaks, The optimality of distributive constructions of minimum weight and degree restricted spanning tree in complete networks of processes. SIAM J. Comput. 16(2), 231-236 (1987)
211. E. Korach, D. Rotem, N. Santoro, Distributed algorithms for finding centers and medians in networks. ACM Trans. Program. Lang. Syst. 6(3), 380-401 (1984)
212. E. Korach, G. Tel, S. Zaks, Optimal synchronization of ABD networks, in Proc. Int'l Conference on Concurrency. LNCS, vol. 335 (Springer, Berlin, 1988), pp. 353-367
213. R. Kordale, M. Ahamad, A scalable technique for implementing multiple consistency levels for distributed objects, in Proc. 16th IEEE Int'l Conference on Distributed Computing Systems (ICDCS'96) (IEEE Press, New York, 1996), pp. 369-376
214. A. D. Kshemkalyani, Fast and message-efficient global snapshot algorithms for large-scale distributed systems. IEEE Trans. Parallel Distrib. Syst. 21(9), 1281-1289 (2010)
215. A. D. Kshemkalyani, M. Raynal, M. Singhal, Global snapshots of a distributed systems. Distrib. Syst. Eng. 2(4), 224-233 (1995)
216. A. D. Kshemkalyani, M. Singhal, Invariant-based verification of a distributed deadlock detection algorithm. IEEE Trans. Softw. Eng. 17(8), 789-799 (1991)
217. A. D. Kshemkalyani, M. Singhal, Efficient detection and resolution of generalized distributed deadlocks. IEEE Trans. Softw. Eng. 20(1), 43-54 (1994)
218. A. D. Kshemkalyani, M. Singhal, Necessary and sufficient conditions on information for causal message ordering and their optimal implementation. Distrib. Comput. 11(2), 91-111 (1998)
219. A. D. Kshemkalyani, M. Singhal, A one-phase algorithm to detect distributed deadlocks in replicated databases. IEEE Trans. Knowl. Data Eng. 11(6), 880-895 (1999)
220. A. D. Kshemkalyani, M. Singhal, Distributed Computing: Principles, Algorithms and Systems (Cambridge University Press, Cambridge, 2008), 736 pages
221. A. D. Kshemkalyani, M. Singhal, Efficient distributed snapshots in an anonymous asynchronous message-passing system. J. Parallel Distrib. Comput. 73, 621-629 (2013)
222. T.-H. Lai, Termination detection for dynamically distributed systems with non-first-in-firstout communication. J. Parallel Distrib. Comput. 3(4), 577-599 (1986)
223. T. H. Lai, T. H. Yang, On distributed snapshots. Inf. Process. Lett. 25, 153-158 (1987)
224. T. V. Lakshman, A. K. Agrawala, Efficient decentralized consensus protocols. IEEE Trans. Softw. Eng. SE-12(5), 600-607 (1986)
225. K. B. Lakshmanan, N. Meenakshi, K. Thulisaraman, A time-optimal message-efficient distributed algorithm for depth-first search. Inf. Process. Lett. 25, 103-109 (1987)
226. K. B. Lakshmanan, K. Thulisaraman, On the use of synchronizers for asynchronous communication networks, in Proc. 2nd Int'l Workshop on Distributed Algorithms (WDAG'87). LNCS, vol. 312 (Springer, Berlin, 1987), pp. 257-267
227. L. Lamport, Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558-565 (1978)
228. L. Lamport, How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. C-28(9), 690-691 (1979)
229. L. Lamport, On inter-process communications, part I: basic formalism. Distrib. Comput. 1(2), 77-85 (1986)
230. L. Lamport, On inter-process communications, part II: algorithms. Distrib. Comput. 1(2), 86-101 (1986)
231. L. Lamport, P. M. Melliar-Smith, Synchronizing clocks in the presence of faults. J. ACM 32(1), 52-78 (1985)
232. Y. Lavallée, G. Roucairol, A fully distributed minimal spanning tree algorithm. Inf. Process. Lett. 23(2), 55-62 (1986)
233. G. Le Lann, Distributed systems: towards a formal approach, in IFIP World Congress, (1977), pp. 155-160
234. I. Lee, S. B. Davidson, Adding time to synchronous processes. IEEE Trans. Comput. C-36(8), 941-948 (1987)
235. K. Li, K. P. Huda, Memory coherence in shared virtual memory systems. ACM Trans. Comput. Syst. 7(4), 321-359 (1989)
236. T. F. Li, Th. Radhakrishnan, K. Venkatesh, Global state detection in non-FIFO networks, in Proc. 7th Int'l Conference on Distributed Computing Systems (ICDCS'87) (IEEE Press, New York, 1987), pp. 364-370
237. N. Linial, Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193-201 (1992)
238. R. J. Lipton, J. S. Sandberg, PRAM: a scalable shared memory. Tech Report CS-TR-180-88, Princeton University, 1988
239. B. Liskov, R. Ladin, Highly available distributed services and fault-tolerant distributed garbage collection, in Proc. 5th ACM Symposium on Principles of Distributed Computing (PODC'86) (ACM Press, New York, 1986), pp. 29-39
240. S. Lodha, A. D. Ksemkalyani, A fair distributed mutual exclusion algorithm. IEEE Trans. Parallel Distrib. Syst. 11(6), 537-549 (2000)
241. M. Luby, A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036-1053 (1987)
242. N. A. Lynch, Upper bounds for static resource allocation in a distributed system. J. Comput. Syst. Sci. 23(2), 254-278 (1981)
243. N. A. Lynch, Distributed Algorithms (Morgan Kaufmann, San Francisco, 1996), 872 pages
244. M. Maekawa, A √n algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3(2), 145-159 (1985)
245. N. Malpani, J. L. Welch, N. Vaidya, Leader election algorithms for mobile ad hoc networks, in Proc. 4th Int'l ACM Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M'00) (ACM Press, New York, 2000), pp. 96-103
246. Y. Manabe, R. Baldoni, M. Raynal, S. Aoyagi, k-arbiter: a safe and general scheme for h-out of-k mutual exclusion. Theor. Comput. Sci. 193(1-2), 97-112 (1998)
247. D. Manivannan, R. H. B. Netzer, M. Singhal, Finding consistent global checkpoints in a distributed computation. IEEE Trans. Parallel Distrib. Syst. 8(6), 623-627 (1997)
248. D. Manivannan, M. Singhal, A low overhead recovery technique using quasi-synchronous checkpointing, in Proc. 16th IEEE Int'l Conference on Distributed Computing Systems (ICDCS'96) (IEEE Press, New York, 1996), pp. 100-107
249. D. Manivannan, M. Singhal, An efficient distributed algorithm for detection of knots and cycles in a distributed graph. IEEE Trans. Parallel Distrib. Syst. 14(10), 961-972 (2003)
250. F. Mattern, Algorithms for distributed termination detection. Distrib. Comput. 2(3), 161-175 (1987)
251. F. Mattern, Virtual time and global states of distributed systems, in Proc. Parallel and Distributed Algorithms Conference, ed. by M. Cosnard, P. Quinton, M. Raynal, Y. Robert (North-Holland, Amsterdam, 1988), pp. 215-226
252. F. Mattern, Global quiescence detection based on credit distribution and recovery. Inf. Process. Lett. 30(4), 195-200 (1989)
253. F. Mattern, An efficient distributed termination test. Inf. Process. Lett. 31(4), 203-208 (1989)
254. F. Mattern, Efficient algorithms for distributed snapshots and global virtual time approximation. J. Parallel Distrib. Comput. 18, 423-434 (1993)
255. F. Mattern, Distributed algorithms and causally consistent observations, in Proc. 16th Int'l Conference on Application and Theory of Petri Nets, (Invited Paper). LNCS, vol. 935 (Springer, Berlin, 1995), pp. 21-22
256. F. Mattern, S. Fünfrocken, A non-blocking lightweight implementation of causal order message delivery, in Proc. Int'l Dagstuhl Workshop on Theory and Practice in Distributed Systems. LNCS, vol. 938 (Springer, Berlin, 1995), pp. 197-213
257. M. Mavronicolas, D. Roth, Efficient, strong consistent implementations of shared memory, in Proc. 6th Int'l Workshop on Distributed Algorithms (WDAG'92). LNCS, vol. 647 (Springer, Berlin, 1992), pp. 346-361
258. J. Mayo, Ph. Kearns, Efficient distributed termination detection with roughly synchronized clocks. Inf. Process. Lett. 52(2), 105-108 (1994)
259. K. Mehlhorn, P. Sanders, Algorithms and Data Structures (Springer, Berlin, 2008), 300 pages
260. D. Menasce, R. Muntz, Locking and deadlock detection in distributed database. IEEE Trans. Softw. Eng. SE-5(3), 195-202 (1979)
261. J. R. Mendívil, F. Fariña, C. F. Garitagoitia, C. F. Alastruey, J. M. Barnabeu-Auban, A distributed deadlock resolution algorithm for the AND model. IEEE Trans. Parallel Distrib. Syst. 10(5), 433-447 (1999)
262. J. Misra, Detecting termination of distributed computations using markers, in Proc. 2nd ACM Symposium on Principles of Distributed Computing (PODC'83) (ACM Press, New York, 1983), pp. 290-294
263. J. Misra, Axioms for memory access in asynchronous hardware systems. ACM Trans. Program. Lang. Syst. 8(1), 142-153 (1986)
264. J. Misra, Distributed discrete event simulation. ACM Comput. Surv. 18(1), 39-65 (1986)
265. J. Misra, K. M. Chandy, A distributed graph algorithm: knot detection. ACM Trans. Program. Lang. Syst. 4(4), 678-686 (1982)
266. J. Misra, K. M. Chandy, Termination detection of diffusing computations in communicating sequential processes. ACM Trans. Program. Lang. Syst. 4(1), 37-43 (1982)
267. D. P. Mitchell, M. Merritt, A distributed algorithm for deadlock detection and resolution, in Proc. 3rd ACM Symposium on Principles of Distributed Computing (PODC'84) (ACM Press, New York, 1984), pp. 282-284
268. N. Mittal, V. K. Garg, Consistency conditions for multi-objects operations, in Proc. 18th IEEE Int'l Conference on Distributed Computing Systems (ICDCS'98) (IEEE Press, New York, 1998), pp. 582-589
269. M. Mizuno, M. L. Nielsen, M. Raynal, An optimistic protocol for a linearizable distributed shared memory service. Parallel Process. Lett. 6(2), 265-278 (1996)
270. M. Mizuno, M. Raynal, J. Z. Zhou, Sequential consistency in distributed systems, in Int'l Dagstuhl Workshop on the Theory and Practice in Distributed Systems. LNCS, vol. 938 (Springer, Berlin, 1994), pp. 224-241
271. B. Moret, The Theory of Computation (Addison-Wesley, Reading, 1998), 453 pages
272. A. Mostéfaoui, M. Raynal, Efficient message logging for uncoordinated checkpointing protocols, in Proc. 2nd European Dependable Computing Conference (EDCC'96). LNCS, vol. 1150 (Springer, Berlin, 1996), pp. 353-364
273. A. Mostéfaoui, M. Raynal, P. Veríssimo, Logically instantaneous communication on top of distributed memory parallel machines, in Proc. 5th Int'l Conference on Parallel Computing Technologies (PACT'99). LNCS, vol. 1662 (Springer, Berlin, 1999), pp. 258-270
274. V. V. Murty, V. K. Garg, An algorithm to guarantee synchronous ordering of messages, in Proc. 2nd Int'l IEEE Symposium on Autonomous Decentralized Systems (IEEE Press, New York, 1995), pp. 208-214
275. V. V. Murty, V. K. Garg, Characterization of message ordering specifications and protocols, in Proc. 7th Int'l Conference on Distributed Computer Systems (ICDCS'97) (IEEE Press, New York, 1997), pp. 492-499
276. M. Naimi, M. Trehel, An improvement of the log n distributed algorithm for mutual exclusion, in Proc. 7th Int'l IEEE Conference on Distributed Computing Systems (ICDCS'87) (IEEE Press, New York, 1987), pp. 371-375
277. M. Naimi, M. Trehel, A. Arnold, A log (n) distributed mutual exclusion algorithm based on path reversal. J. Parallel Distrib. Comput. 34(1), 1-13 (1996)
278. M. Naor, A. Wool, The load, capacity and availability of quorums systems. SIAM J. Comput. 27(2), 423-447 (2008)
279. N. Nararajan, A distributed scheme for detecting communication deadlocks. IEEE Trans. Softw. Eng. 12(4), 531-537 (1986)
280. M. L. Neilsen, M. Mizuno, A DAG-based algorithm for distributed mutual exclusion, in Proc. 11th IEEE Int'l IEEE Conference on Distributed Computing Systems (ICDCS'91) (IEEE Press, New York, 1991), pp. 354-360
281. M. L. Neilsen, M. Masaaki, Nondominated k-coteries for multiple mutual exclusion. Inf. Process. Lett. 50(5), 247-252 (1994)
282. M. L. Neilsen, M. Masaaki, M. Raynal, A general method to define quorums, in Proc. 12th Int'l IEEE Conference on Distributed Computing Systems (ICDCS'92) (IEEE Press, New York, 1992), pp. 657-664
283. M. Nesterenko, M. Mizuno, A quorum-based self-stabilizing distributed mutual exclusion algorithm. J. Parallel Distrib. Comput. 62(2), 284-305 (2002)
284. R. H. B. Netzer, J. Xu, Necessary and sufficient conditions for consistent global snapshots. IEEE Trans. Parallel Distrib. Syst. 6(2), 165-169 (1995)
285. N. Neves, W. K. Fuchs, Adaptive recovery for mobile environments. Commun. ACM 40(1), 68-74 (1997)
286. S. Nishio, K. F. Li, F. G. Manning, A resilient distributed mutual exclusion algorithm for computer networks. IEEE Trans. Parallel Distrib. Syst. 1(3), 344-356 (1990)
287. B. Nitzberg, V. Lo, Distributed shared memory: a survey of issues and algorithms. IEEE Comput. 24(8), 52-60 (1991)
288. R. Obermarck, Distributed deadlock detection algorithm. ACM Trans. Database Syst. 7(2), 197-208 (1982)
289. J. K. Pachl, E. Korach, D. Rotem, Lower bounds for distributed maximum-finding algorithms. J. ACM 31(4), 905-918 (1984)
290. Ch. H. Papadimitriou, The serializability of concurrent database updates. J. ACM 26(4), 631-653 (1979)
291. D. S. Parker, G. L. Popek, G. Rudisin, L. Stoughton, B. J. Walker, E. Walton, J. M. Chow, D. A. Edwards, S. Kiser, C. S. Kline, Detection of mutual inconsistency in distributed systems. IEEE Trans. Softw. Eng. SE9(3), 240-246 (1983)
292. B. Patt-Shamir, S. Rajsbaum, A theory of clock synchronization, in Proc. 26th Annual ACM Symposium on Theory of Computing (STOC'94) (ACM Press, New York, 1994), pp. 810-819
293. D. Peleg, Distributed Computing: A Locally-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000), 343 pages
294. D. Peleg, J. D. Ullman, An optimal synchronizer for the hypercube. SIAM J. Comput. 18, 740-747 (1989)
295. D. Peleg, A. Wool, Crumbling walls: a class of practical and efficient quorum systems. Distrib. Comput. 10(2), 87-97 (1997)
296. G. L. Peterson, An O (n log n) unidirectional algorithm for the circular extrema problem. ACM Trans. Program. Lang. Syst. 4(4), 758-762 (1982)
297. L. L. Peterson, N. C. Bucholz, R. D. Schlichting, Preserving and using context information in interprocess communication. ACM Trans. Comput. Syst. 7(3), 217-246 (1989)
298. S. E. Pomares Hernadez, J. R. Perez Cruz, M. Raynal, From the happened before relation to the causal ordered set abstraction. J. Parallel Distrib. Comput. 72, 791-795 (2012)
299. R. Prakash, M. Raynal, M. Singhal, An adaptive causal ordering algorithm suited to mobile computing environments. J. Parallel Distrib. Comput. 41(1), 190-204 (1997)
300. R. Prakash, M. Singhal, Low-cost checkpointing and failure recovery in mobile computing systems. IEEE Trans. Parallel Distrib. Syst. 7(10), 1035-1048 (1996)
301. R. Prakash, M. Singhal, Dependency sequences and hierarchical clocks: efficient alternatives to vector clocks for mobile computing systems. Wirel. Netw. 3(5), 349-360 (1997)
302. J. Protic, M. Tomasevic, Distributed shared memory: concepts and systems. IEEE Concurr. 4(2), 63-79 (1996)
303. S. P. Rana, A distributed solution of the distributed termination problem. Inf. Process. Lett. 17(1), 43-46 (1983)
304. B. Randell, System structure for software fault-tolerance. IEEE Trans. Softw. Eng. SE1(2), 220-232 (1975)
305. K. Raymond, A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7(1), 61-77 (1989)
306. K. Raymond, A distributed algorithm for multiple entries to a critical section. Inf. Process. Lett. 30(4), 189-193 (1989)
307. M. Raynal, Algorithms for Mutual Exclusion (The MIT Press, Cambridge, 1986), 107 pages. ISBN 0-262-18119-3
308. M. Raynal, A distributed algorithm to prevent mutual drift between n logical clocks. Inf. Process. Lett. 24, 199-202 (1987)
309. M. Raynal, Networks and Distributed Computation: Concepts, Tools and Algorithms (The MIT Press, Cambridge, 1987), 168 pages. ISBN 0-262-18130-4
310. M. Raynal, Prime numbers as a tool to design distributed algorithms. Inf. Process. Lett. 33, 53-58 (1989)
311. M. Raynal, A simple taxonomy of distributed mutual exclusion algorithms. Oper. Syst. Rev. 25(2), 47-50 (1991)
312. M. Raynal, A distributed solution to the k-out of-M resource allocation problem, in Proc. Int'l Conference on Computing and Information. LNCS, vol. 497 (Springer, Berlin, 1991), pp. 509-518
313. M. Raynal, Illustrating the use of vector clocks in property detection: an example and a counter-example, in Proc. 5th European Conference on Parallelism (EUROPAR'99). LNCS, vol. 1685 (Springer, Berlin, 1999), pp. 806-814
314. M. Raynal, Sequential consistency as lazy linearizability, in Proc. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA'02) (ACM Press, New York, 2002), pp. 151-152
315. M. Raynal, Token-based sequential consistency. Comput. Syst. Sci. Eng. 17(6), 359-365 (2002)
316. M. Raynal, Fault-Tolerant Agreement in Synchronous Distributed Systems (Morgan & Claypool, San Francisco, 2010), 167 pages. ISBN 9781608455256
317. M. Raynal, Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems (Morgan & Claypool, San Francisco, 2010), 251 pages. ISBN 9781608452934
318. M. Raynal, Concurrent Programming: Algorithms, Principles, and Foundations (Springer, Berlin, 2012), 500 pages. ISBN 978-3-642-32026-2
319. M. Raynal, M. Ahamad, Exploiting write semantics in implementing partially replicated causal objects, in Proc. 6th EUROMICRO Conference on Parallel and Distributed Processing (PDP'98) (IEEE Press, New York, 1998), pp. 157-163
320. M. Raynal, J.-M. Hélary, Synchronization and Control of Distributed Systems and Programs. Wiley Series in Parallel Computing (1991), 126 pages. ISBN 0-471-92453-9
321. M. Raynal, M. Roy, C. Tutu, A simple protocol offering both atomic consistent read operations and sequentially consistent read operations, in Proc. 19th Int'l Conference on Advanced Information Networking and Applications (AINA'05) (IEEE Press, New York, 2005), pp. 961-966
322. M. Raynal, G. Rubino, An algorithm to detect token loss on a logical ring and to regenerate lost tokens, in Int'l Conference on Parallel Processing and Applications (North-Holland, Amsterdam, 1987), pp. 457-467
323. M. Raynal, A. Schiper, From causal consistency to sequential consistency in shared memory systems, in Proc. 15th Int'l Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS'95). LNCS, vol. 1026 (Springer, Berlin, 1995), pp. 180-194
324. M. Raynal, A. Schiper, A suite of formal definitions for consistency criteria in distributed shared memories, in Proc. 9th Int'l IEEE Conference on Parallel and Distributed Computing Systems (PDCS'96) (IEEE Press, New York, 1996), pp. 125-131
325. M. Raynal, A. Schiper, S. Toueg, The causal ordering abstraction and a simple way to implement. Inf. Process. Lett. 39(6), 343-350 (1991)
326. M. Raynal, S. Singhal, Logical time: capturing causality in distributed systems. IEEE Comput. 29(2), 49-57 (1996)
327. M. Raynal, K. Vidyasankar, A distributed implementation of sequential consistency with multi-object operations, in Proc. 24th IEEE Int'l Conference on Distributed Computing Systems (ICDCS'04) (IEEE Press, New York, 2004), pp. 544-551
328. G. Ricart, A. K. Agrawala, An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24(1), 9-17 (1981)
329. G. Ricart, A. K. Agrawala, Author response to "on mutual exclusion in computer networks" by Carvalho and Roucairol. Commun. ACM 26(2), 147-148 (1983)
330. R. Righter, J. C. Walrand, Distributed simulation of discrete event systems. Proc. IEEE 77(1), 99-113 (1989)
331. S. Ronn, H. Saikkonen, Distributed termination detection with counters. Inf. Process. Lett. 34(5), 223-227 (1990)
332. D. J. Rosenkrantz, R. E. Stearns, P. M. Lewis, System level concurrency control in distributed databases. ACM Trans. Database Syst. 3(2), 178-198 (1978)
333. D. L. Russell, State restoration in systems of communicating processes. IEEE Trans. Softw. Eng. SE6(2), 183-194 (1980)
334. B. Sanders, The information structure of distributed mutual exclusion algorithms. ACM Trans. Comput. Syst. 5(3), 284-299 (1987)
335. S. K. Sarin, N. A. Lynch, Discarding obsolete information in a replicated database system. IEEE Trans. Softw. Eng. 13(1), 39-46 (1987)
336. N. Santoro, Design and Analysis of Distributed Algorithms (Wiley, New York, 2007), 589 pages
337. A. Schiper, J. Eggli, A. Sandoz, A new algorithm to implement causal ordering, in Proc. 3rd Int'l Workshop on Distributed Algorithms (WDAG'89). LNCS, vol. 392 (Springer, Berlin, 1989), pp. 219-232
338. R. Schmid, I. C. Garcia, F. Pedone, L. E. Buzato, Optimal asynchronous garbage collection for RDT checkpointing protocols, in Proc. 25th Int'l Conference on Distributed Computing Systems (ICDCS'01) (IEEE Press, New York, 2005), pp. 167-176
339. F. Schmuck, The use of efficient broadcast in asynchronous distributed systems. Doctoral Dissertation, Tech. Report TR88-928, Dept of Computer Science, Cornell University, 124 pages, 1988
340. F. B. Schneider, Implementing fault-tolerant services using the state machine approach. ACM Comput. Surv. 22(4), 299-319 (1990)
341. R. Schwarz, F. Mattern, Detecting causal relationships in distributed computations: in search of the Holy Grail. Distrib. Comput. 7, 149-174 (1994)
342. A. Segall, Distributed network protocols. IEEE Trans. Inf. Theory 29(1), 23-35 (1983)
343. N. Shavit, N. Francez, A new approach to detection of locally indicative stability, in 13th Int'l Colloquium on Automata, Languages and Programming (ICALP'86). LNCS, vol. 226 (Springer, Berlin, 1986), pp. 344-358
344. A. Silberschatz, Synchronization and communication in distributed systems. IEEE Trans. Softw. Eng. SE5(6), 542-546 (1979)
345. L. M. Silva, J. G. Silva, Global checkpoints for distributed programs, in Proc. 11th Symposium on Reliable Distributed Systems (SRDS'92) (IEEE Press, New York, 1992), pp. 155-162
346. M. Singhal, A heuristically-aided algorithm for mutual exclusion in distributed systems. IEEE Trans. Comput. 38(5), 651-662 (1989)
347. M. Singhal, Deadlock detection in distributed systems. IEEE Comput. 22(11), 37-48 (1989)
348. M. Singhal, A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems. Distrib. Comput. 4(3), 131-138 (1991)
349. M. Singhal, A dynamic information-structure mutual exclusion algorithm for distributed systems. IEEE Trans. Parallel Distrib. Syst. 3(1), 121-125 (1992)
350. M. Singhal, A taxonomy of distributed mutual exclusion. J. Parallel Distrib. Comput. 18(1), 94-101 (1993)
351. M. Singhal, A. D. Kshemkalyani, An efficient implementation of vector clocks. Inf. Process. Lett. 43, 47-52 (1992)
352. M. Sipser, Introduction to the Theory of Computation (PWS, Boston, 1996), 396 pages
353. A. P. Sistla, J. L. Welch, Efficient distributed recovery using message logging, in Proc. 8th ACM Symposium on Principles of Distributed Computing (PODC'89) (ACM Press, New York, 1989), pp. 223-238
354. D. Skeen, A quorum-based commit protocol, in Proc. 6th Berkeley Workshop on Distributed Data Management and Computer Networks (1982), pp. 69-80
355. J. L. A. Van De Snepscheut, Synchronous communication between asynchronous components. Inf. Process. Lett. 13(3), 127-130 (1981)
356. J. L. A. Van De Snepscheut, Fair mutual exclusion on a graph of processes. Distrib. Comput. 2(2), 113-115 (1987)
357. T. Soneoka, T. Ibaraki, Logically instantaneous message passing in asynchronous distributed systems. IEEE Trans. Comput. 43(5), 513-527 (1994)
358. M. Spezialetti, Ph. Kearns, Efficient distributed snapshots, in Proc. 6th Int'l Conference on Distributed Computing Systems (ICDCS'86) (IEEE Press, New York, 1986), pp. 382-388
359. T. K. Srikanth, S. Toueg, Optimal clock synchronization. J. ACM 34(3), 626-645 (1987)
360. M. Van Steen, Graph Theory and Complex Networks: An Introduction (2011), 285 pages. ISBN 978-90-815406-1-2
361. R. E. Strom, S. Yemini, Optimistic recovery in distributed systems. ACM Trans. Comput. Syst. 3(3), 204-226 (1985)
362. I. Suzuki, T. Kasami, A distributed mutual exclusion algorithm. ACM Trans. Comput. Syst. 3(4), 344-349 (1985)
363. G. Taubenfeld, Synchronization Algorithms and Concurrent Programming (Pearson Prentice-Hall, Upper Saddle River, 2006), 423 pages. ISBN 0-131-97259-6
364. K. Taylor, The role of inhibition in asynchronous consistent-cut protocols, in Proc. 3rd Int'l Workshop on Distributed Algorithms (WDAG'87). LNCS, vol. 392 (Springer, Berlin, 1987), pp. 280-291
365. R. N. Taylor, Complexity of analyzing the synchronization structure of concurrent programs. Acta Inform. 19(1), 57-84 (1983)
366. G. Tel, Introduction to Distributed Algorithms, 2nd edn. (Cambridge University Press, Cambridge, 2000), 596 pages. ISBN 0-521-79483-8
367. G. Tel, F. Mattern, The derivation of distributed termination detection algorithms from garbage collection schemes. ACM Trans. Program. Lang. Syst. 15(1), 1-35 (1993)
368. G. Tel, R. B. Tan, J. Van Leeuwen, The derivation of graph-marking algorithms from distributed termination detection protocols. Sci. Comput. Program. 10(1), 107-137 (1988)
369. R. H. Thomas, A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst. 4(2), 180-209 (1979)
370. O. Theel, M. Raynal, Static and dynamic adaptation of transactional consistency, in Proc. 30th Hawaï, Int'l Conference on Systems Sciences (HICSS-30), vol. I (1997), pp. 533-542
371. F. J. Torres-Rojas, M. Ahamad, Plausible clocks: constant size logical clocks for distributed systems. Distrib. Comput. 12(4), 179-195 (1999)
372. F. Torres-Rojas, M. Ahamad, M. Raynal, Lifetime-based consistency protocols for distributed objects, in Proc. 12th Int'l Symposium on Distributed Computing (DISC'98). LNCS, vol. 1499 (Springer, Berlin, 1998), pp. 378-392
373. F. Torres-Rojas, M. Ahamad, M. Raynal, Timed consistency for shared distributed objects, in Proc. 18th Annual ACM Symposium on Principles of Distributed Computing (PODC'99) (ACM Press, New York, 1999), pp. 163-172
374. S. Toueg, An all-pairs shortest paths distributed algorithm. IBM Technical Report RC 8327, 1980
375. M. Trehel, M. Naimi, Un algorithme distribué d'exclusion mutuelle en log n. TSI. Tech. Sci. Inform. 6(2), 141-150 (1987)
376. J. Tsai, S.-Y. Kuo, Y.-M. Wang, Theoretical analysis for communication-induced checkpointing protocols with rollback-dependency trackability. IEEE Trans. Parallel Distrib. Syst. 9(10), 963-971 (1998)
377. J. Tsai, Y.-M. Wang, S.-Y. Kuo, Evaluations of domino-free communication-induced checkpointing protocols. Inf. Process. Lett. 69(1), 31-37 (1999)
378. S. Venkatesan, Message optimal incremental snapshots, in Proc. 9th Int'l Conference on Distributed Computing Systems (ICDCS'89) (IEEE Press, New York, 1989), pp. 53-60
379. S. Venkatesan, B. Dathan, Testing and debugging distributed programs using global predicates. IEEE Trans. Softw. Eng. 21(2), 163-177 (1995)
380. J. Villadangos, F. Fariña, J. R. Mendívil, C. F. Garitagoitia, A. Cordoba, A safe algorithm for resolving OR deadlocks. IEEE Trans. Softw. Eng. 29(7), 608-622 (2003)
381. M. Vukolić, Quorum Systems with Applications to Storage and Consensus (Morgan & Claypool, San Francisco, 2012), 130 pages. ISBN 798-1-60845-683-3
382. Y.-M. Wang, Consistent global checkpoints that contain a given set of local checkpoints. IEEE Trans. Comput. 46(4), 456-468 (1997)
383. Y.-M. Wang, P. Y. Chung, I. J. Lin, W. K. Fuchs, Checkpointing space reclamation for uncoordinated checkpointing in message-passing systems. IEEE Trans. Parallel Distrib. Syst. 6(5), 546-554 (1995)
384. Y.-M. Wang, W. K. Fuchs, Optimistic message logging for independent checkpointing in message-passing systems, in Proc. 11th Symposium on Reliable Distributed Systems (SRDS'92) (IEEE Press, New York, 1992), pp. 147-154
385. S. Warshall, A theorem on Boolean matrices. J. ACM 9(1), 11-12 (1962)
386. J. L. Welch, Simulating synchronous processors. Inf. Comput. 74, 159-171 (1987)
387. J. L. Welch, N. A. Lynch, A new fault-tolerance algorithm for clock synchronization. Inf. Comput. 77(1), 1-36 (1988)
388. J. L. Welch, N. A. Lynch, A modular drinking philosophers algorithm. Distrib. Comput. 6(4), 233-244 (1993)
389. J. L. Welch, J. E. Walter, Link Reversal Algorithms (Morgan & Claypool, San Francisco, 2011), 93 pages. ISBN 9781608450411
390. H. Wu, W.-N. Chin, J. Jaffar, An efficient distributed deadlock avoidance algorithm for the AND model. IEEE Trans. Softw. Eng. 28(1), 18-29 (2002)
391. G. T. J. Wuu, A. J. Bernstein, Efficient solutions to the replicated log and dictionary problems, in Proc. 3rd Annual ACM Symposium on Principles of Distributed Computing (PODC'84) (ACM Press, New York, 1984), pp. 233-242
392. G. T. J. Wuu, A. J. Bernstein, False deadlock detection in distributed systems. IEEE Trans. Softw. Eng. SE-11(8), 820-821 (1985)
393. M. Yamashita, T. Kameda, Computing on anonymous networks, part I: characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7(1), 69-89 (1996)
394. M. Yamashita, T. Kameda, Computing on anonymous networks, part II: decision and membership problems. IEEE Trans. Parallel Distrib. Syst. 7(1), 90-96 (1996)
395. L.-Y. Yen, T.-L. Huang, Resetting vector clocks in distributed systems. J. Parallel Distrib. Comput. 43, 15-20 (1997)
396. Y. Zhu, C.-T. Cheung, A new distributed breadth-first search algorithm. Inf. Process. Lett. 25(5), 329-333 (1987)