A Novel Data Grid Coherence Protocol Using Pipeline-Based Aggressive Copy Method

Wang, Reen-Cheng; Wu, Su-Ling; Chang, Ruay-Shiung

doi:10.1007/978-3-540-72360-8_41

Cited by 3 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pick one unreached destination that can be reached in the maximum possible bandwidth from reached nodes. The method is explained in [4], and a similar method is proposed in [8].…”

Section: Depth-first (Fpfr [4]-like)mentioning

confidence: 99%

See 1 more Smart Citation

A Stable Broadcast Algorithm

Takahashi

Saitō

Shibata

et al. 2008

2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID)

View full text Add to dashboard Cite

Distributing large data to many nodes, known as a broadcast or a multicast, is an important operation in parallel and distributed computing. Most previous broadcast algorithms explicitly or implicitly try to deliver data to all nodes in the same rate. This assumption is reasonable for homogeneous environments where all nodes have similar receiving capabilities. However, when nodes have various receiving capabilities, nodes with slow-receiving capabilities slow down the entire receiving bandwidth in these algorithms. In such settings, each node desires to receive data at its largest possible bandwidth and to start computation as soon as it receives the data.In this paper, we propose to say a broadcast is stable when the bandwidth to a node is never sacrificed by the presence of other, possibly slow, receiving nodes, and proposes the stability as a desired property of broadcast algorithms. In addition, we show a simple and efficient stable broadcast when the topology among nodes is a tree and each link has a symmetric bandwidth. This work improves upon previously proposed algorithms such as FPFR and Balanced Multicasting. For general graphs, it outperforms them when the network is heterogeneous and for trees, our algorithm is proved to be stable and optimal.In a real environment with 100 machines in 4 clusters, our scheme achieved 2.1 to 2.6 times aggregate bandwidth compared to the best result in the other algorithms. We also demonstrated the stability by adding a slow node to a broadcast. Some simulations also showed that our algorithm also performs well in many bandwidth distributions.

show abstract

“…Pick one unreached destination that can be reached in the maximum possible bandwidth from reached nodes. The method is explained in [4], and a similar method is proposed in [8].…”

Section: Depth-first (Fpfr [4]-like)mentioning

confidence: 99%

“…Another approach uses Dijkstra method to construct a relaying structure [8]. In this method, two node sets are maintained: one is reachable-set, a set of nodes that are already connected to the source, and another is unrechable-set, a set of nodes that are not already connected to the source.…”

Section: Topology-aware Broadcastmentioning

confidence: 99%

A Stable Broadcast Algorithm

Takahashi

Saitō

Shibata

et al. 2008

2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID)

View full text Add to dashboard Cite

show abstract

“…Including lazy replication [8,9] , aggressive replication [8][9][10][11] and hybrid replica consistency services [12][13][14][15][16] . They make effort in performance, availability and consistency, but not study the efficiency, scalability of the protocol itself.…”

Section: Introductionmentioning

confidence: 99%

Access Weight Replica Consistency Protocol for Large Scale Data Grid

Radi¹,

Mamat²,

Deris³

et al. 2008

J. of Computer Science

View full text Add to dashboard Cite

Replication is a well known technique to improve reliability and performance for a Data Grid. Keeping consistent content at all distributed replica is an important subject in Data Grid. Replica consistency protocol using classical propagation method called the radial method suffers from high overhead at the master replica site, while line method suffers from high delay time. In Data Grid not all replicas can be dealt with in the same way, since some will be in greater demand than others. Updating first replica having most demand, a greater number of clients would access the updated content in a shorter period of time. In this study, based on asynchronous aggressive update propagation technique, a scalable replica consistency protocol is developed to maintain replica consistency in data grid which aimed to reaching delay reduction and load balancing, such that the high access weight replicas updated faster than the others. The simulation results shows that the proposed protocol is capable of sending the updates to high access replicas in a short period while reducing the total update propagation repose time and reached load balancing.

show abstract

Enhancing Data Replication with Greedy Pipeline-Based Aggressive Copy Protocol in Data Grids

Wang

Chang

2007

Parallel and Distributed Processing and Applications

View full text Add to dashboard Cite

A Novel Data Grid Coherence Protocol Using Pipeline-Based Aggressive Copy Method

Cited by 3 publications

References 6 publications

A Stable Broadcast Algorithm

A Stable Broadcast Algorithm

Access Weight Replica Consistency Protocol for Large Scale Data Grid

Enhancing Data Replication with Greedy Pipeline-Based Aggressive Copy Protocol in Data Grids

Contact Info

Product

Resources

About