This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance characterization of quorum-consensus algorithms for replicated data
April 1989 (vol. 15 no. 4)
pp. 492,493,494,495,496
ASCII Text
x 
 
"Performance characterization of quorum-consensus algorithms for replicated data," IEEE Transactions on Software Engineering, vol. 15, no. 4, pp. 492,493,494,495,496, April, 1989.
 
 
BibTex
x
 
@article{ 10.1109/32.16608,
author = {},
title = {Performance characterization of quorum-consensus algorithms for replicated data},
journal ={IEEE Transactions on Software Engineering},
volume = {15},
number = {4},
issn = {0098-5589},
year = {1989},
pages = {492,493,494,495,496},
doi = {http://doi.ieeecomputersociety.org/10.1109/32.16608},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Software Engineering
TI - Performance characterization of quorum-consensus algorithms for replicated data
IS - 4
SN - 0098-5589
SP
EP
EPD - 492,493,494,495,496
PY - 1989
KW - transaction processing
KW - concurrency control
KW - distributed databases
KW - performance evaluation
KW - quorum assignment
KW - quorum-consensus algorithms
KW - replicated data
KW - performance measures
KW - quorum-consensus algorithm
KW - consistency
KW - successfully completed transactions
KW - transaction waits
KW - Voting
KW - Availability
KW - Delay
KW - Data systems
KW - Time measurement
KW - Degradation
KW - Database systems
KW - Hardware
KW - Application software
KW - Industrial control
VL - 15
JA - IEEE Transactions on Software Engineering
ER -
 
The authors develop a model and define performance measures for a replicated data system that makes use of a quorum-consensus algorithm to maintain consistency. They consider two measures: the proportion of successfully completed transactions in systems where a transaction aborts if data is not available, and the mean response time in systems where a transaction waits until data becomes available. Based on the model, the authors show that for some quorum assignment there is an optimal degree of replication beyond which performance degrades. There exist other quorum assignments which have no optimal degree of replication. The authors also derive optimal read and write quorums which maximize the proportion of successful transactions.<>

[1] J. Gray, "Notes on database operation systems," inOperating Systems: An Advanced Course(Lecture Notes in Computer Science, vol. 60) Berlin: Springer-Verlag, 1978.
[2] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[3] M. P. Herlihy, "A quorum-consensus replication method for abstract data types,"ACM Trans. Comput. Syst., vol. 4, no. 1, Feb. 1986.
[4] D. L. Eager and K. C. Sevcik, "Achieving robustness in distributed data-base systems,"ACM Trans. Database Syst., vol. 8, no. 3, pp. 354-381, Sept. 1983.
[5] S. Jajodia and D. Mutchler, "Dynamic voting," inProc. 1987 ACM SIGMOD, San Francisco, CA, May 1987, pp. 227-238.
[6] M. Herlihy, "Dynamic quorum adjustment for partitioned data," Carnegie-Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU-CS-86- 147.
[7] 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.
[8] D. Barbara and H. Garcia-Molina, "The reliability of voting mechanisms,"IEEE Trans. Comput., vol. C-36, no. 10, pp. 1197-1208, Oct. 1987.
[9] S. Mourad and D. Andrews, "The reliability of the IBM/XA operating system," inDig. 15th Int. Symp. Fault-Tolerant Computing, June 1985.
[10] L. Kleinrock,Queueing Systems, vol. 1. New York: Wiley Interscience, 1975.
[11] D. P. Heyman and M. J. Sobel,Stochastic Models in Operations Research, vol. 1. New York: McGraw-Hill, 1982.
[12] A. V. Drake,Fundamentals of Applied Probability. New York: McGraw-Hill, 1967.

Index Terms:
transaction processing,concurrency control,distributed databases,performance evaluation,quorum assignment,quorum-consensus algorithms,replicated data,performance measures,quorum-consensus algorithm,consistency,successfully completed transactions,transaction waits,Voting,Availability,Delay,Data systems,Time measurement,Degradation,Database systems,Hardware,Application software,Industrial control
Citation:
"Performance characterization of quorum-consensus algorithms for replicated data," IEEE Transactions on Software Engineering, vol. 15, no. 4, pp. 492,493,494,495,496, April 1989, doi:10.1109/32.16608
Usage of this product signifies your acceptance of the Terms of Use.