Tuning Constraint-Based Communication in Distributed Problem Solving
Francesca Arcelli, Uwe Borghoff, Ferrante Formato, Remo Pareschi
Distributed Problem Solving (DPS) decomposes problems into subproblems to be solved by interacting,
cooperative software agents. Thus, DPS is suitable for modeling, in the context of parallel and distributed
architectures, the solving of problems characterized by many inter-dependencies among subproblems.
Concurrent Constraint Programming (CCP) provides a powerful execution framework for DPS, where constraints
can declaratively implement both local problem solving as well as exchange of information, and hence DPS,
among agents. To optimize DPS, the protocol for constraint communication must be tuned to the specific kind
of DPS problem and the characteristics of the underlying system architecture. In this paper, we provide a
formal framework for modeling different options and we show how it applies to concrete, generalizable examples.
Proc. of the 1st Intl. Workshop on Concurrent Constraint Programming (CCP'95), May, 1995, Venice, Italy
home.pdf.gz (86.01 kB)
home.ps.gz (51.82 kB)