Designing an Architecture for Distributed Shared Data on the Grid

Authors:
Dacian Tudor;Vladimir Cretu;Wolfgang Schreiner
Affiliations:
Computer Science and Engineering Department, "Politehnica" University of Timisoara, Timisoara, Romania 300223;Computer Science and Engineering Department, "Politehnica" University of Timisoara, Timisoara, Romania 300223;Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria 4040
Venue:
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
Year:
2008

Citing 6
Cited 0

A log (N) distributed mutual exclusion algorithm based on path reversal

Journal of Parallel and Distributed Computing
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
LOTS: a software DSM supporting large object space

CLUSTER '04 Proceedings of the 2004 IEEE International Conference on Cluster Computing
Hierarchical token based mutual exclusion algorithms

CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
A Replication Model for Trading Data Integrity against Availability

PRDC '06 Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing
A Composition Approach to Mutual Exclusion Algorithms for Grid Applications

ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Despite the continuous advances of the last years in grid computing, the grid computing programming paradigms are dominated by the message passing concept. There is little support for other paradigms such as shared data or associative programming. In this paper we analyze some of the existing solutions for grid shared data programming and highlight some of their drawbacks. We propose a new architecture and its core features as well as new evaluation means of its behavior in various scenarios including the next generation grid systems. In addition to the simplicity of our solution, we believe that it would allow us to easily apply further extensions.