Open AccessJournal Article
Distributed Chemical Computing: A Feasibility Study.
Marko Obrovac,Cédric Tedeschi +1 more
5
TL;DR: The theoretical analysis as well as the experimental campaign conducted on a first prototype establish the viability of the framework proposed, thus lifting a barrier towards the full adoption of the chemical model.
read more
Abstract: Chemical Programming was born to fill the lack of naturally parallel languages. In such a paradigm, a computation is envisioned as a solution of information-carrying molecules colliding non-deterministically. On collisions, new molecules, and thus new data, are produced. With the rise of service-oriented computing, such models have recently regained momentum, and have been shown to be an adequate means to express the dynamic coordination of services in an autonomic fashion. However, the execution of programs written following this model at large scale is still a widely open problem, hindering it to be actually leveraged. This paper studies the possibility of building a distributed execution environment for chemical programs. A runtime model and algorithms to distribute the runtime of chemical programs are proposed on top of a peer-to-peer environment. The theoretical analysis as well as the experimental campaign conducted on a first prototype establish the viability of the framework proposed, thus lifting a barrier towards the full adoption of the chemical model.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A bio-inspired method for the constrained shortest path problem.
TL;DR: This paper proposes an innovative method which is based on the internal mechanism of the adaptive amoeba algorithm to solve the constrained shortest path problem in directed networks.
•Dissertation
Chemical Computing for Distributed Systems: Algorithms and Implementation
Marko Obrovac
- 28 Mar 2013
TL;DR: L'architecture proposee combine une couche de communication pair-a-pair avec un protocole de capture atomique d'objets sur lesquels les regles doivent etre appliquees, and un systeme efficace de detection de terminaison.
3
On the Complexity of Concurrent Multiset Rewriting
TL;DR: This paper explores the possibility of improving the complexity of searching elements (or "reactants") through a static analysis of the reaction condition through the modeling of the problem with graphs, based on the results of the well-known subgraph isomorphism problem.
•Dissertation
A chemistry-inspired middleware for flexible execution of service based applications
Chen Wang
- 28 May 2013
TL;DR: A two-phase online prediction approach is proposed that is able to accurately make decisions to proactively execute adaptation plan before the failures actually occur and to find out generic solutions, such as models and algorithms, to respond to some of the most challenging problems in flexible execution of SBAs.
•Dissertation
Distributed Chemically-Inspired Runtimes for Large Scale Adaptive Computing Platforms
Cédric Tedeschi
- 11 Apr 2017
TL;DR: HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not.