The grid protocol: a high performance scheme for maintaining replicated data

Author

Cheung, Shun Yan ; Ammar, Mostafa H. ; Ahamad, Mustaque

Author_Institution

Dept. of Math. & Comput. Sci., Emory Univ., Atlanta, GA, USA

Volume

4

Issue

6

fYear

1992

fDate

12/1/1992 12:00:00 AM

Firstpage

582

Lastpage

592

Abstract

A new protocol for maintaining replicated data that can provide both high data availability and low response time is presented. In the protocol, the nodes are organized in a logical grid. Existing protocols are designed primarily to achieve high availability by updating a large fraction of the copies, which provides some (although not significant) load sharing. In the new protocol, transaction processing is shared effectively among nodes storing copies of the data, and both the response time experienced by transactions and the system throughput are improved significantly. The authors analyze the availability of the new protocol and use simulation to study the effect of load sharing on the response time of transactions. They also compare the new protocol with a voting-based scheme

Keywords

database theory; distributed databases; transaction processing; distributed database; grid protocol; high data availability; load sharing; low response time; replicated data maintenance; simulation; system throughput; transaction processing; voting-based scheme; Access protocols; Analytical models; Availability; Computer science; Control systems; Delay effects; Mathematics; Throughput; Voting; Writing;

fLanguage

English

Journal_Title

Knowledge and Data Engineering, IEEE Transactions on

Publisher

ieee

ISSN

1041-4347

Type

jour

DOI

10.1109/69.180609

Filename

180609