Parallel implementation of bags

Kuchen, Herbert; Gladitz, Katia

doi:10.1145/165180.165226

Cited by 9 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The same group has investigated the introduction of the Gamma paradigm in a functional language 39 . They introduce the multiset as a data structuring facility and multiset versions of operations fold and map.…”

Section: An Implementation On Shared Memory Machinesmentioning

confidence: 99%

Gamma and the Chemical Reaction Model: Ten Years After

Banâtre

Métayer

1996

Coordination Programming: Mechanisms, Models and Semantics

View full text Add to dashboard Cite

Gamma was originally proposed in 1986 as a formalism for the de nition of programs without arti cial sequentiality. The basic idea underlying the formalism is to describe computation as a form of chemical reaction on a collection of individual pieces of data. Due to the very minimal nature of the language, and its absence of sequential bias, it has been possible to exploit this initial paradigm in various directions. This paper reviews most of the work done by various groups along these lines and the current perspectives of our own research on Gamma. For the sake of clarity we separate the contributions in three categories: (1) the relevance of the chemical reaction model for software engineering, (2) extensions of the original model and (3) implementation issues.

show abstract

Section: An Implementation On Shared Memory Machinesmentioning

confidence: 99%

Gamma and the Chemical Reaction Model: Ten Years After

Banâtre

Métayer

1996

Coordination Programming: Mechanisms, Models and Semantics

View full text Add to dashboard Cite

show abstract

“…A naïve implementation would check the reaction condition for all k-tuples of bag elements. A special class of Gamma schemes which mainly includes the well-known operations map and fold on bags, has been efficiently implemented on a shared memory machine (Kuchen and Gladitz, 1993). Creveuil (1991) describes an implementation of very special Gamma schemes on a Connection machine.…”

Section: Introductionmentioning

confidence: 99%

Shared Memory Implementation of the Gamma-Operation

Gladitz

Kuchen

1996

Journal of Symbolic Computation

Self Cite

View full text Add to dashboard Cite

The Gamma scheme allows the specification of an application without introducing unnecessary sequentiality. The main idea is to simulate a chemical reaction on multisets, also called bags. Some elements of a bag which fulfil a certain predicate (also called reaction condition) may be taken from the multiset and replaced by new elements which are generated by combining the selected elements using the so-called reaction function.In the present paper, we investigate the efficient parallel implementation of the Gamma scheme. In particular, the reaction condition can be split into parts which are tested as early as possible. Possible atomic conditions are arithmetic comparisons. We use the properties of the arithmetic comparisons in order to restrict the range of bag elements which has to be considered. Reconsiderations of the same bag elements are avoided. Moreover, a sophisticated protocol is needed in order to avoid deadlocks when several processes compete for the same bag elements. Experimental results show the impact of our improvements.

show abstract

“…For example on MIMD machines in the original work of Banâtre et al. [BCL88], and by Kuchen and Gladitz [KG93,GK96]; the connection machine [Cre91], and even Field-programmable gate arrays (FPGA's) [Vie96].…”

Section: Introductionmentioning

confidence: 99%

From Gamma to CBS: refining multiset transformations with broadcasting processes

Sands

Weichert

Proceedings of the Thirty-First Hawaii International Conference on System Sciences

View full text Add to dashboard Cite

This paper presents a novel approach to the problem of implementing programs in Gamma, a computation model of chemical-reaction-like multiset transformations, by translating them into a process calculus with broadcasting c ommunication, CBS. The concurrent message reception of broadcasting communication ts very naturally to the implicit parallelism of the Gamma model: A value that may trigger reactions with several others in the multiset is broadcast to the potential receivers and may thus react with all of them at the same time. This kind of triggering reactions, which we call quasi-unary, is very common in Gamma programs and is found in a large class of problems. The translation constitutes a correct renement of the Gamma program and oers possibilities for further optimisations for several classes of problems. We address termination of Gamma programs and identify several classes of programs where termination can be detected and practically implemented. 1

show abstract

Parallel implementation of bags

Cited by 9 publications

References 5 publications

Gamma and the Chemical Reaction Model: Ten Years After

Gamma and the Chemical Reaction Model: Ten Years After

Shared Memory Implementation of the Gamma-Operation

From Gamma to CBS: refining multiset transformations with broadcasting processes

Contact Info

Product

Resources

About