참고문헌
- G. LeLann, 'Distributed systems-towards a formal approach,' in Information Processing 77, B. Gilchrist, Ed. North-Holland, 1977
- H.Garcia-Molian, 'Elections in a distributed computing system,' IEEE Transactions on Computers, vol. C-31, no. 1, pp. 49-59, Han 1982 https://doi.org/10.1109/TC.1982.1675885
- H. Abu-Amara and J. Lokre, 'Election in asynchronous complete networks with intermittent link failures.' IEEE Transactions on Computers, vol. 43, no.7, pp.778-788, 1994 https://doi.org/10.1109/12.293257
- H.M. Sayeed, M. Abu-Amara, and H. Aou-Avara, 'Optimal asynchronous agreement and leader election algorithm for complete networks with byzantine faulty links.,' Distributed Computing, vol. 9, no. 3, pp. 147-156, 1995 https://doi.org/10.1007/s004460050016
- J. Brunekreef, J.-P. Katoen, R. Koyrnans, and S. Mauw, 'Design and analysis of dynamic leader election protocols in broadcast networks,' Distributed Computing, vol. 9, no. 4, pp. 157-171, 1996 https://doi.org/10.1007/s004460050017
- G. Singh, 'Leader election in the presence of link failures,' IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 3, pp. 231-236, March 1996 https://doi.org/10.1109/71.491576
- M. Fischer, N. Lynch, and M. Paterson. Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, pp. 374-382. (32) 1985 https://doi.org/10.1145/3149.214121
- T. Chandra and S.Toueg. Unreliable failure detectors for reliable clistributed systems. Technical Report, Department of computer Science, Cornell Univ., 1994
- D. Doleb and R Strong. A Simple Model For Agreement in Distributed Systems. In Fault-Tolerant Distributed computing, pp. 42-59. B. Simons and A. Spector ed, Springer Verlag (LNCS 448, 1987
- T. Chandra, V. Hadzilacos, and S. Toueg. The Weakest Failure Detector for Solving Consensus. Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, pp. 147-158. ACM press, 1992
- Rachid Guerraoui. Revisiting the relationship between non-blocking atomic commitment and consensus. In Proceedings of the 10th International Workshop on Distributed Algorithms, Springer Verlag (LNCS 857), 1996
- P.A.Bernstein, V. Hadzilacos, and N. Goodman. ?Concurrency Control and Recovery in Database Systems. Addison Wesley, 1987
- Hopcroft J.E. and Ullman J.D. Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading, Mass., 418 pages, 1979
- Garey M.R. and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman W.H & Co, New York, 340 pages, 1979
- Eddy Fromentin, Michel R RAY, Frederic TRONEL. On Classes of Problems in Asynchronous Distributed Systems. In Proceedings of Distributed Computing Conference. IEEE 10.4, June 1999 https://doi.org/10.1109/ICDCS.1999.776549
- Hadzilacos V. and Toueg S. Reliable Broadcast and Related Problems. In Distributed Systems (Second Edition), ACM Press, New York, pp.97-145, 1993
- V. Hadzilacos. On the relationship between the atomic commitment and consensus problems. In Fault- Tolerant Distributed Computing, pp. 201208. B. Simons and A. spector ed, Springer Verlag (LNCS 448), 1987
- A. Schiper and A. Sandoz. Primary Partition Virtually-Synchronous Communication harder than consensus. In Proceedings of the 8th Workshop on Distributed Algorithms, 1994
- L. Sabel and K. Marzullo. Election vs. Consensus in Asynchronous Systems. Technical Report TR95-1488, cornell Univ, 1995
- R. Guerraoui and A. Schiper. Transaction model vs Virtual Synchrony model: bridging the gap. In Distributed Systems: From Theory to Practice, pp. 121-132. K. Birman, F. Mattern and A. Schiper ed, Springer Verlag (LNCS 938), 1995 https://doi.org/10.1007/3-540-60042-6_9