The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
A parallel machine for multiset transformation and its programming style
Future Generation Computer Systems
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Artificial chemistries—a review
Artificial Life
A Distributed Solution to the k-out of-M Resources Allocation Problem
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Atomic Data Access in Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Generalised multisets for chemical programming
Mathematical Structures in Computer Science
A Formal Model of Crash Recovery in a Distributed System
IEEE Transactions on Software Engineering
Squid: Enabling search in DHT-based systems
Journal of Parallel and Distributed Computing
A biochemical approach to adaptive service ecosystems
Information Sciences: an International Journal
Decentralized Approach for Execution of Composite Web Services Using the Chemical Paradigm
ICWS '10 Proceedings of the 2010 IEEE International Conference on Web Services
Adaptive atomic capture of multiple molecules
Journal of Parallel and Distributed Computing
Rule-driven service coordination middleware for scientific applications
Future Generation Computer Systems
Hi-index | 0.00 |
With the rise of service-oriented computing, applications are more and more based on coordination of autonomous services. Envisioned over largely distributed and highly dynamic platforms, expressing this coordination calls for alternative programming models. The chemical programming paradigm, which models applications as chemical solutions where molecules representing digital entities involved in the computation, react together to produce a result, has been recently shown to provide the needed abstractions for autonomic coordination of services. However, the execution of such programs over large scale platforms raises several problems hindering this paradigm to be actually leveraged. Among them, the atomic capture of molecules participating in concurrent reactions is one of the most significant. In this paper, we propose a protocol for the atomic capture of these molecules distributed and evolving over a large scale platform. As the density of possible reactions is crucial for the liveness and efficiency of such a capture, the protocol proposed is made up of two sub-protocols, each of them aimed at addressing different levels of densities of potential reactions in the solution. While the decision to choose one or the other is local to each node participating in a program's execution, a global coherent behaviour is obtained. Proof of liveness, as well as intensive simulation results showing the efficiency and limited overhead of the protocol are given.