A simple token-based algorithm for the mutual exclusion problem in distributed systems

P Neamatollahi, Y Sedaghat… - The Journal of …, 2017 - Springer
Solving the problem of mutually exclusive access to a critical resource is a major challenge
in distributed systems. In some solutions, there is a unique token in the whole system which …

Rule-driven service coordination middleware for scientific applications

H Fernandez, C Tedeschi, T Priol - Future Generation Computer Systems, 2014 - Elsevier
With the proliferation of Web services, scientific applications are more and more designed as
temporal compositions of services, commonly referred to as workflows. To address this …

Combining workflow templates with a shared space-based execution model

JR Balderrama, M Simonin… - 2014 9th Workshop …, 2014 - ieeexplore.ieee.org
The growth for scientific data has led to data analysis being a critical step in the scientific
process. The next generation scientific data analysis environment needs to address two …

Adaptive atomic capture of multiple molecules

M Bertier, M Obrovac, C Tedeschi - Journal of Parallel and Distributed …, 2013 - Elsevier
Facing the scale, heterogeneity and dynamics of the global computing platform emerging on
top of the Internet, autonomic computing has been raised recently as one of the top …

Deployment and evaluation of a decentralised runtime for concurrent rule-based programming models

M Obrovac, C Tedeschi - … , ICDCN 2013, Mumbai, India, January 3-6, 2013 …, 2013 - Springer
With the emergence of highly heterogeneous, dynamic and large distributed platforms,
declarative programming, whose goal is to ease the programmer's task by separating the …

When Distributed Hash Tables Meet Chemical Programming for Autonomic Computing

M Obrovac, C Tedeschi - 2012 IEEE 26th International Parallel …, 2012 - ieeexplore.ieee.org
With the rise of Service Computing, applications are more and more built as temporal
compositions of autonomous services, in which services are combined dynamically to satisfy …

[PDF][PDF] Algorithmes efficaces de recherche pour une machine chimique pair-a-pair

M Perrin, MBC Tedeschi - Rapport de stage ÉNS Cachan, 2012 - researchgate.net
Résumé La difficulté de la programmation des systemes répartisa large échelle est encore
aujourd'hui un freina leur développement. Le paradigme chimique fournit une abstraction de …

On the Complexity of Concurrent Multiset Rewriting

M Bertier, M Perrin, C Tedeschi - International Journal of …, 2016 - World Scientific
In this paper, we are interested in the runtime complexity of programs based on multiset
rewriting. The motivation behind this work is the study of the complexity of chemistry-inspired …

[PDF][PDF] Distributed Chemically-Inspired Runtimes for Large Scale Adaptive Computing Platforms

C Tedeschi - 2017 - theses.hal.science
Every time a new type of computing platforms appears, the challenge comes back:
increasing the amount of computing resources does not guarantee that such a computing …

A chemical programming language for orchestrating services: Application to interoperability problems

M Lacouture - 2014 - theses.hal.science
With the emergence of cloud computing and mobile applications, it is possible to find a web
service for almost everything. Moreover, developers can create complex applications by …