A Protocol for the Atomic Capture of Multiple Molecules on Large Scale Platforms
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.
KeywordsMutual Exclusion Distribute Hash Table Switch Threshold Chemical Program Reaction Rule
Unable to display preview. Download preview PDF.
- 2.Viroli, M., Zambonelli, F.: A Biochemical Approach to Adaptive Service Ecosystems. Information Sciences (2009)Google Scholar
- 3.Banâtre, J.-P., Priol, T.: Chemical Programming of Future Service-oriented Architectures. Journal of Software 4 (2009)Google Scholar
- 6.Banâtre, J.-P., Fradet, P., Radenac, Y.: Generalised Multisets for Chemical Programming. Mathematical Structures in Computer Science 16 (2006)Google Scholar
- 7.Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: SIGCOMM, pp. 149–160 (2001)Google Scholar
- 10.Schneider, F.B.: Implementing Fault-Tolerant Services Using the State Machine Approach: a Tutorial. ACM Comput. Surv. 22 (1990)Google Scholar
- 12.Skeen, D., Stonebraker, M.: A Formal Model of Crash Recovery in a Distributed System. IEEE Transactions on Software Engineering SE-9(3) (1983)Google Scholar
- 13.Lampson, B.W., Sturgis, H.E.: Crash recovery in a distributed data storage system (1979)Google Scholar
- 15.Lin, H., Kemp, J., Gilbert, P.: Computing Gamma Calculus on Computer Cluster. IJTD 1(4), 42–52 (2010)Google Scholar
- 19.Fernandez, H., Priol, T., Tedeschi, C.: Decentralized approach for execution of composite web services using the chemical paradigm. In: ICWS, pp. 139–146 (2010)Google Scholar