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
Efficient, flexible, and typed group communications in Java
JGI '02 Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
MSS '01 Proceedings of the Eighteenth IEEE Symposium on Mass Storage Systems and Technologies
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
NIST Net: a Linux-based network emulation tool
ACM SIGCOMM Computer Communication Review
PPPJ '03 Proceedings of the 2nd international conference on Principles and practice of programming in Java
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
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
IEEE Transactions on Computers
Designing a Dynamic Replication Engine for Grid Shared Data Programming
SYNASC '08 Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Introduction to OGSA-DAI services
SAG'04 Proceedings of the First international conference on Scientific Applications of Grid Computing
Hi-index | 0.00 |
Despite the continuous advances of the last years in 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 analyse why previous attempts did not have a significant impact in the grid computing community. We start by assessing the landscape of grid programming solutions with a focus on shared data concepts. Next, we introduce an original idea to attack shared data programming on the grid by making use of both relaxed consistency models and user specified type consistency in an object-oriented model. Last but not least, we present a prototype architecture together with experimental results.