|
[1] D. Agrawal and A. El Abbadi. “Exploting Logical Structures in Replicated Databases”. Information Processing Letters, 33(5):255-260, 1990. [2] D. Agrawal and A. El Abbadi. “An Efficient and Fault-tolerant Solution for Distributed Mutual Exclusion”. ACM Transactions on Computer System, 9(1):1-20, Feb. 1991. [3] Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi. “Billiard Quorums on the Grid”. Information Processing Letters 64(1): 9-16 (1997) [4] P. Bernstein and N. Goodman. “The Failure and Recovery Problem for Replicated Databases”. In Proc. Second ACM Symp. Principles of Distributed Computing, pages 114-122, Aug. 1983. [5] P.A. Bernstein, V. Hadzilacos, and N. Goodman. “Concurrency Control and Recovery in Database Systems”. Addision-Wesley, 1987. MA. [6] S. Y. Cheung, M. H. Ammar, and M.Ahamad. “The Grid Protocol: A High Performance Scheme for maintaining Replicated Data”. IEEE Transactions on Knowledge and Data Engineering, 4(6):582-592, Dec. 1992. [7] Cheng-Hong Cho and Jer-Tsang Wang. “Triangular Grid Protocol: An Efficient Scheme for Replica Control with Uniform Access Quorums”. In Euro-Par ’96 Parallel Processing Second International Euro-Par Conference Proceedings, pages 843-851, Aug. 1996. [8] S. B. Davidson, H. Garcia-Molina, and D. Skeen. “Consistancy in Partitioned Networks”. ACM Computing Serveys, 17(3):341-370, Sep. 1985. [9] H. Garcia-Molina and D. Barbara. “How to Assign Votes in a Distributed System”. Journal of the ACM, 32(4):841-860, Oct. 1985. [10] D.K. Gifford. “Weighted Voting for Replicated Data”. In Proceedings of the 7th ACM Symposium on Operating System Principles, pages 150-159, 1979. [11] Jehn-Ruey Jiang and Shing-Tsaan Huang, “Obtaining nondominated k-coteries for fault-tolerant distributed k-mutual exclusion”, Proceedings 1994 International Conference on Parallel and Distributed Systems, p. 582-7, 1994. [12] Jehn-Ruey Jiang, Shing-Tsaan Huang and Yu-Chen Kuo. “Cohorts structures for fault-tolerant k entries to a critical section”, IEEE Transactions on Computers, Vol: 46, Iss: 2, p. 222-8, 1997. [13] A. Kumar. “Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data”. IEEE Transactions on Computers, 40(9):996-1004, Sep. 1991. [14] Yu-Chen Kuo and Shing-Tsaan Huang, “An improvement of Maekawa’s mutual exclusion algorithm to make it fault-tolerant”. Parallel Processing Letters, Vol. 3, No. 3, p. 307-308, March 1993. [15] Yu-Chen Kuo and Shing-Tsaan Huang, “A simple scheme to construct k-coteries with O(square root N) uniform quorum sizes", Information Processing Letters, Vol: 59, Iss: 1, p. 31-6, 1996. [16] Yu-Chen Kuo and Shing-Tsaan Huang. "A geometric approach for constructing coteries and k-coteries", IEEE Transactions on Parallel and Distributed Systems, Vol: 8, Iss: 4 , p. 402-11, 1997. [17] Yu-Chen Kuo and Shing-Tsaan Huang. "Recognizing nondominated coteries and wr-coteries by availability", IEEE Transactions on Parallel and Distributed Systems, Vol:9, Iss: 8, p.721-8, 1998. [18] Ching-Min Lin, Ge-Ming Chiu, and Cheng-Hong Cho. “An Efficient Quorum-Based Scheme for Managing Replicated Data in Distributed Systems”,In Proceedings of International Conference on Parallel Processing ,1999. [19] Wai-Shing Luk and Tien-Tsin Wong. “Two New Quorum Based Algorithms for Distributed Mutual Exclusion”. In Proceedings of Int’l Conf. on Distributed Computing Systems, pages 100-106, May 1997. [20] Jr. Marshall Hall. “Combinatorial Theory”. John Wiley and Sons, 1986, Chapter 11. [21] N. C. Mendonca and R. O. Anido. “Using Extended Hierarchical Quorum Consensus to Control Replicated Data: from Traditional Voting to Logical Structures”. In Proceedings of the 27th Annual Hawaii International Conference on System Science, pages 303-312, 1994. [22] M. Maekawa, “A N0.5 Algorithm for Mutual Exclusion in Decentralized System”. ACM Trans. Computer System, 3(1985) 145-159. [23] D. Malkhi and M. Reiter. “Byzantine Quorum Systems”.In Proceedings of the 29th ACM Symp. Theory of computing, May 1997. [24] D. Malkhi, M. Reiter and A. Wool. “The Load and Availability of Byzantine Quorum Systems”.In Proceedings of the 16th Annual ACM Symposium on the Principles of Distributed Computing, August 1997. [25] M. L. Neilsen, M. Misuno, and M.Raynal. “A General Method to Define Quorums”. In Proceeding of the 12th International Conference on Distributed Computing Systems, pages 657-664, 1992. [26] Wee K. Ng and Chinya V. Ravishankar. “Coterie Templates: A New Quorum Construction Method”. ICDCS 1995: 92-99. [27] David Peleg and Avishai Wool, “Crumbling walls: a class of practical and efficient quorum systems”, Distributed Computing, Vol 10, p. 87-97, 1997. [28] R. Schlichting and F. Schneider. “Fail-stop Processors”. ACM Transactions on Computer Systems, 1:303-312, 1994. [29] R. H. Thomas. “A majority Consensus Approach to Concurrency Control for Multiple Copy Databases”. ACM Transactions on Database Systems, 4(2):180-209, Jun, 1979. [30] Chienwen Wu. “A Fault Tolerant O(N0.5) Algorithm for Distributed Mutual Exclusion”. In The 20th Annual International Phoenix Conference on Computers and Communications, pages 175-180, 1993. [31] Y. T. Wu, Y. J. Chang, S.M. Yuan, and H. K. Chang. “A New Quorum-Based Replica Control Protocol”. In Proceeding. Pacific Rim International Symposium on Fault-tolerant Systems, pages 116-121, Dec. 1997.
|