The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1989 vol.15)
pp: 492,493,494,495,496
ABSTRACT
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.<>
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
SEARCH
8 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool