Shared Memory Implementation of the Gamma-Operation

Gladitz, Katia; Kuchen, Herbert

doi:10.1006/jsco.1996.0032

Cited by 11 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Gladitz and Kuchen [8] explored the possibility of reducing the number of steps needed to find suitable candidates and consequently detect inertia. They showed that by carefully examining the reaction condition one is able to considerably decrease the amount of computation required to find candidates and detect inertia.…”

Section: Related Workmentioning

confidence: 99%

When Distributed Hash Tables Meet Chemical Programming for Autonomic Computing

Obrovac¹,

Tedeschi²

2012

2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops &Amp; PhD Forum

View full text Add to dashboard Cite

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 constantly arriving users' requests. These applications run on top of web-based, large, unreliable, and heterogeneous platforms, in which there is a high demand for autonomic behaviours, such as selfoptimisation, self-adaptation, or self-healing.Chemistry-inspired computing consists in envisioning a computation as a succession of implicitly parallel, distributed and autonomous reactions, each reaction consuming molecules of data to produce new ones, until the state of inertia, where no more reactions are possible. This vision of a computation makes it a promising candidate to inject autonomic behaviours in service computing.However, while the benefits of such a model are manifold, its deployment over large scale platforms remains a widely open issue. In this paper, after identifying the main obstacles towards such a deployment, we propose a peer-to-peer framework able to execute chemical specifications at large scale. It combines distributed hash tables and algorithms for the atomic capture of molecules, and proposes an efficient method for inertia detection, which is a critical problem, in particular when addressed in a large scale environment. The sustainability of the framework is established through a complete complexity analysis.

show abstract

Section: Related Workmentioning

confidence: 99%

When Distributed Hash Tables Meet Chemical Programming for Autonomic Computing

Obrovac¹,

Tedeschi²

2012

2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops &Amp; PhD Forum

View full text Add to dashboard Cite

show abstract

“…To our knowledge, the problem of searching molecules to implement the chemical model as a computing paradigm, has only been addressed through exhaustive search, in particular in distributed settings, as studied in works like [14] in a shared memory architecture, or more recently, in the architectural framework in [21].…”

Section: Reactants Searching Problemmentioning

confidence: 99%

On the Complexity of Concurrent Multiset Rewriting

Bertier

Perrin

Tedeschi

2016

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

International audienceIn 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 programming models, which recently regained momentum due to their adequacy to the programming of large autonomous systems. In these models, data are most of the time left unstructured in a container, or more formally, a multiset. The program to be applied to this multiset is specified as a set of conditioned rules rewriting the multiset. At run time, these rewrite operations are applied concurrently, until no rule can be applied anymore (the set of elements they need cannot be found in the multiset anymore). A limitation of these models stands in their complexity: each computation step may require a complexity in O(n^k) where n denotes the number of elements in the multiset, and k is the size of the subset of elements needed to trigger a given rule. By analogy with chemistry, such elements can be called reactants. In this paper, we explore the possibility of improving the complexity of searching reactants through a static analysis of the rules' condition. In particular, we give a char-acterisation of this complexity, by analogy to the subgraph isomorphism problem. Given a rule R, we define its rank rk(R) and its calibre C(R), allowing us to exhibit an algorithm with a complexity in O(n^(rk(R)+C(R))) for searching reactants, while showing that rk(R) + C(R) ≤ k and that rk(R) + C(R) < k most of the time

show abstract

“…Although there were discussions about implementing the Gamma language on parallel computers [22][23][24], it is commonly accepted that there is no straight implementation of the Gamma language that is efficient. After all, the Gamma language was designed as a very high level language for program specifications and is, therefore, used to specify the architectures of the coordinating systems, as described in Section 2.…”

Section: From Architecture To Building Blocksmentioning

confidence: 99%

Specifying distributed multi-agent systems in chemical reaction metaphor

Lin

Yang²

2006

Appl Intell

View full text Add to dashboard Cite

This paper presents an application of Chemical Reaction Metaphor (CRM) in distributed multi-agent systems (MAS). The suitability of using CRM to model multiagent systems is justified by CRM's capacity in specifying dynamic features of multi-agent systems. A case study in an agent-based e-learning system (course material updating) demonstrates how the CRM based language, Gamma, can be used to specify the architectures of multi-agent systems. The effectiveness of specifying multi-agent systems in CRM from the view point of software engineering is further justified by introducing a transformational method for implementing the specified multi-agent systems. A computation model with a tree-structured architecture is proposed to base the design of the specified multi-agent system during the implementation phase. A module language based on the computation model is introduced as an intermediate language to facilitate the translation of the specification of multi-agent systems. The multicast networking technology pragmatizes the implementation of communications and synchronization among distributed agents. The paper also discusses the feasibility of implementing an automatic translation from the Gamma specification to a program in the module language.

show abstract

Shared Memory Implementation of the Gamma-Operation

Cited by 11 publications

References 15 publications

When Distributed Hash Tables Meet Chemical Programming for Autonomic Computing

When Distributed Hash Tables Meet Chemical Programming for Autonomic Computing

On the Complexity of Concurrent Multiset Rewriting

Specifying distributed multi-agent systems in chemical reaction metaphor

Contact Info

Product

Resources

About