Optimizing and evaluating algorithms for replicated data concurrency control

Akhil Kumar, Arie Segev

Research output: Contribution to conferencePaper

3 Scopus citations

Abstract

Many algorithms for replicated data concurrency control are based on voting methods. Techniques are developed for optimizing the assignment of votes in an environment where intersite communications costs are nonuniform and individual site reliabilities vary. These techniques apply to all algorithms that are based on voting. Availability is considered as a realistic measure of reliability, and so is incorporated in an optimization model. The optimization model is based on minimizing communications costs subject to a given availability constraint. A semiexhaustive algorithm is described for solving this model. The algorithm utilizes a signature-based method for identifying equivalent vote combinations and an efficient technique for computing availability. It is compared to an equal vote assignment to estimate the extent of possible savings in communications costs.

Original languageEnglish (US)
Pages101-109
Number of pages9
StatePublished - Jun 1 1989
Event9th International Conference on Distributed Computing Systems - Newport Beach, CA, USA
Duration: Jun 5 1989Jun 9 1989

Other

Other9th International Conference on Distributed Computing Systems
CityNewport Beach, CA, USA
Period6/5/896/9/89

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Kumar, A., & Segev, A. (1989). Optimizing and evaluating algorithms for replicated data concurrency control. 101-109. Paper presented at 9th International Conference on Distributed Computing Systems, Newport Beach, CA, USA, .