By Topic

How to Achieve High Throughput with Dynamic Tree-Structured Coterie

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Frain, I. ; Inst. de Recherche en Informatique de Toulouse, Univ. Paul Sabatier, Toulouse ; M'zoughi, A. ; Bahsoun, J.-P.

Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintaining the data consistent between replicas may become difficult if the read/write system has to ensure sequential consistency. In this paper, we limit the overhead due to the data consistency protocols by introducing a new dynamic quorum protocol called the elementary permutation protocol. This protocol permits the dynamic reconfiguration of a tree-structured coterie (Agrawal and Abbadi, 1991) in function of the load of the machines that possess the data replicas. It applies a tree transformation in order to obtain a new less loaded coterie. This permutation is based on the load information of a small group of machines possessing the copies. The implementation and the evaluation of our algorithm have been based on the existing atomic read/write service of Lynch and Shvartsman (1997). We demonstrate that the elementary permutation ameliorates the system's throughput up to 50% in the best case. The results of our simulation show that the tree reconfiguration based on the elementary permutation is more efficient for a relatively small number of copies

Published in:

Parallel and Distributed Computing, 2006. ISPDC '06. The Fifth International Symposium on

Date of Conference:

6-9 July 2006