Using coordination for cooperative constraint solving

Arbab, Farhad; Monfroy, Éric

doi:10.1145/330560.330661

Cited by 3 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There exist several proposals whose main goal is to study the use of control languages to specify elementary constraint solvers as well as the collaboration of solvers in a uniform and flexible way. For instance, Arbab and Monfroy (1998) propose to use the coordination language MANIFOLD for improving the constraintsolver collaboration language of BALI. More recent works such as Monfroy and Castro (2004) and Castro and Monfroy (2004) aim at providing means of designing strategies that are more complex than simple master-slave approaches.…”

Section: Interoperabilitymentioning

confidence: 99%

On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP

Martín

Hortalá-González

Rodríguez-Artalejo

et al. 2009

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

This paper presents a computational model for the cooperation of constraint domains and an implementation for a particular case of practical importance. The computational model supports declarative programming with lazy and possibly higher-order functions, predicates, and the cooperation of different constraint domains equipped with their respective solvers, relying on a so-called constraint functional logic programming (CFLP) scheme. The implementation has been developed on top of theCFLPsystem, supporting the cooperation of the three domains ℋ, ℛ, and ℱ, which supply equality and disequality constraints over symbolic terms, arithmetic constraints over the real numbers, and finite domain constraints over the integers, respectively. The computational model has been proved sound and complete w.r.t. the declarative semantics provided by theCFLPscheme, while the implemented system has been tested with a set of benchmarks and shown to behave quite efficiently in comparison to the closest related approach we are aware of.

show abstract

Section: Interoperabilitymentioning

confidence: 99%

On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP

Martín

Hortalá-González

Rodríguez-Artalejo

et al. 2009

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

show abstract

“…MANIFOLD has been used in a number of real applications, e.g., implementing parallel and distributed versions of a semi-coarsened multi-grid Euler solver algorithm [23,24]; modeling cooperative Information Systems [37,38]; coordination of Loosely-Coupled Genetic Algorithms on parallel and distributed platforms [42,43]; coordination of multiple solvers in a concurrent constraint programming system [11]; and coordination of a distributed propositional theorem checker [25].…”

Section: An Informal Overview Of Manifoldmentioning

confidence: 99%

A transition system semantics for the control-driven coordination language MANIFOLD

Bonsangue

Arbab

Bakker

et al. 2000

Theoretical Computer Science

View full text Add to dashboard Cite

Coordination languages are a new class of parallel programming languages which manage the interactions among concurrent programs. Basically, coordination is achieved either by manipulating data values shared among all active processes or by dynamically evolving the interconnections among the processes as a consequence of observations of their state changes. The latter, also called control-driven coordination, is supported by MANIFOLD. We present the formal semantics of a kernel of MANIFOLD, based on a two-level transition system model: the first level is used to specify the ideal behavior of each single component in a MANIFOLD system, whereas the second level captures their interactions. Although we apply our two-level model in this paper to define the semantics of a control-oriented coordination language, this approach is useful for the formal studies of other coordination models and languages as well.

show abstract

“…IWIM and Manifold are being applied to cooperative constraint solving 33 and to modeling of activities in information systems. 34 The plumbing paradigm inherent in IWIM makes it easy to compose and recompose a Manifold application and adapt it to new requirements.…”

Section: Performance Evaluationmentioning

confidence: 99%

Reusable coordinator modules for massively concurrent applications

Arbab

Blom

Burger

et al. 1998

Softw: Pract. Exper.

View full text Add to dashboard Cite

SUMMARYIsolating computation and communication concerns into separate pure computation and pure coordination modules enhances modularity, understandability and reusability of parallel and/or distributed software. MANIFOLD is a pure coordination language that encourages this separation. We use real, concrete, running MANIFOLD programs to demonstrate the concept of pure coordination modules and the advantage of their reuse in applications of different natures. Performance results for the examples presented in this paper show that the overhead of using MANIFOLD to achieve this enhanced modularity and reusability is in practice small, compared to the more conventional paradigms for the design and programming of parallel and distributed software.

show abstract

Using coordination for cooperative constraint solving

Cited by 3 publications

References 14 publications

On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP

On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP

A transition system semantics for the control-driven coordination language MANIFOLD

Reusable coordinator modules for massively concurrent applications

Contact Info

Product

Resources

About