Generalization of the fast consistency algorithm to a grid with multiple high demand zones

Authors:
Jesús Acosta-Elias;Leandro Navarro-Moldes
Affiliations:
Polytechnic University of Catalonia, Spain;Polytechnic University of Catalonia, Spain
Venue:
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
Year:
2003

Citing 15
Cited 1

Experience with Grapevine: the growth of a distributed system

ACM Transactions on Computer Systems (TOCS)
Scalable, Secure, and Highly Available Distributed File Access

Computer
The process group approach to reliable distributed computing

Communications of the ACM
Weak-consistency group communication and membership

Weak-consistency group communication and membership
DEC data distributor: for data replication and data warehousing

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Flexible update propagation for weakly consistent replication

Proceedings of the sixteenth ACM symposium on Operating systems principles
On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
An improved algorithm for decentralized extrema-finding in circular configurations of processes

Communications of the ACM
On the origin of power laws in Internet topologies

ACM SIGCOMM Computer Communication Review
A Demand based Algorithm for Rapid Updating of Replicas

ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
A Dynamic Replica Selection Algorithm for Tolerating Timing Faults

DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Fast Reconciliations in Fluid Replication

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Weak consistency: a generalized theory and optimistic implementations for distributed transactions

Weak consistency: a generalized theory and optimistic implementations for distributed transactions
Design and evaluation of a continuous consistency model for replicated services

OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4

Performance evaluation of a self-organized hierarchical topology for update of replicas in a large distributed system

ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the main challenges of grid systems of large scale and data intensive is that of providing high availability and performance, in spite of the unreliability and delay occasioned by the size of Internet. Replication enables us to meet such a challenge with success. In the context of weak consistency, the fast consistency algorithm prioritizes replicas with high demand. Nevertheless, the fast consistency algorithm only works well in a single zone of high demand, whereas in multiple high demand zones its performance is poor. In this paper, we propose an algorithm chosen according to demand, whereby the replicas in each zone of high demand select leader replicas that subsequently construct a logical topology, linking all the replicas together. In this way, changes are able to reach all the high demand replicas without the low demand zones forming a barrier to prevent this from happening.