This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On a Unified Framework for the Evaluation of Distributed Quorum Attainment Protocols
November 1994 (vol. 20 no. 11)
pp. 868-884

Quorum attainment protocols are an important part of many mutual exclusion algorithms. Assessing the performance of such protocols in terms of number of messages, as is usually done, may be less significant than being able to compute the delay in attaining the quorum. Some protocols achieve higher reliability at the expense of increased message cost or delay. A unified analytical model which takes into account the network delay and its effect on the time needed to obtain a quorum is presented. A combined performability metric, which takes into account both availability and delay, is defined, and expressions to calculate its value are derived for two different reliable quorum attainment protocols: D. Agrawal and A. El Abbadi's (1991) and Majority Consensus algorithms (R.H. Thomas, 1979). Expressions for the primary site approach are also given as upper bound on performability and lower bound on delay. A parallel version of the Agrawal and El Abbadi protocol is introduced and evaluated. This new algorithm is shown to exhibit lower delay at the expense of a negligible increase in the number of messages exchanged. Numerical results derived from the model are discussed.

[1] D. Agrawal and A. El Abbadi, "An efficient and fault-tolerant solution for distributed mutual exclusion,"ACM Trans. Comp. Syst., vol. 9, no. 1, pp. 1-20, Feb. 1991.
[2] P. A. Alsberg and J. D. Day, "A principle for resilient sharing of distributed resources," inProc. 2nd Int. Conf. Software Eng., San Franscisco, CA, Oct. 1976, pp. 562-570.
[3] J. M. Bernabéu-Aubán and M. Ahamad, "Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm," inProc. 3rd Int. Workshop on Distributed Algorithms, Sept. 1989, pp. 33-44.
[4] H. Garcia-Molina and D. Barbara, "How to assign votes in a distributed systems,"J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
[5] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[6] J. L. Hammond and P. J. P. O'Reilly,Performance Analysis of Local Computer Networks. Reading, MA: Addison-Wesley, 1986.
[7] L. Kleinrock,Queueing Systems, Volume I: Theory. New York: Wiley, 1975.
[8] L. Kleinrock,Queueing Systems, Volume II: Computer Applications. New York: Wiley, 1976.
[9] M. H. MacDougall,Simulating Computer Systems, Techniques, and Tools. Cambridge, MA: MIT Press, 1987.
[10] M. Maekawa, "A√N algorithm for mutual exclusion in decentralized systems,"ACM Trans. Comput. Syst., vol. 3, no. 2, May 1985.
[11] S. Rangarajan, S. Setia, and S. K. Tripathi, "Fault-tolerant algorithms for replicated data management," inProc. 8th Int. Conf. Data Eng., Feb. 1992, pp. 230-237.
[12] K. Raymond, "A tree based algorithm for distributed mutual exclusion,"ACM Trans. Comput. Syst., vol. 7, pp. 61-77, 1989.
[13] G. Ricart and A. K. Agrawala, "An optimal algorithm for mutual exclusion in computer networks,"Commun. ACM, vol. 24, pp. 9-17, 1981.
[14] S. Ross,Introduction to Probability Models, 4th ed. New York: Academic Press, 1989.
[15] B. Sanders, "The information structure of distributed mutual exclusion algorithms,"ACM Trans. Programming Languages Syst., vol. 5, no. 3, pp. 284-299, 1987.
[16] M. Singhal, "A heuristically-aided algorithm for mutual exclusion in distributed systems,"IEEE Trans. Computers, vol. 38, pp. 651-662, May 1989.
[17] M. Singhal, "A dynamic information structure mutual exclusion algorithm for distributed systems,"IEEE Trans. Parallel and Distrib. Syst., vol. 3, pp 121-125, Jan. 1992.
[18] R. M. Smith, K. S. Trivedi, and A. V. Ramesh, "Peformability analysis: Measures, an algorithm, and a case study,"IEEE Trans. Computers, vol. C-37, pp. 406-417, Apr. 1988.
[19] I. Suzuki and T. Kasami, "A distributed mutual exclusion algorithm,"ACM Trans. Comput. Syst., vol. 3, no. 4, pp. 344-349, 1985.
[20] R. Thomas, "A majority consensus approach to concurrency control,"ACM Trans. Database Syst., vol. 4, pp. 180-209, June 1979.

Index Terms:
distributed algorithms; protocols; software performance evaluation; software fault tolerance; unified framework; distributed quorum attainment protocols; mutual exclusion algorithms; protocol performance; unified analytical model; network delay; performability metric; Majority Consensus algorithms; primary site approach; performability; parallel version; performance analysis; fault tolerance; distributed systems; delay analysis; tree-based mutual exclusion protocols
Citation:
D.A. Menasce, Y. Yesha, K. Kalpakis, "On a Unified Framework for the Evaluation of Distributed Quorum Attainment Protocols," IEEE Transactions on Software Engineering, vol. 20, no. 11, pp. 868-884, Nov. 1994, doi:10.1109/32.368122
Usage of this product signifies your acceptance of the Terms of Use.