Declarative networking: language, execution and optimization
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
A Formal Model of Crash Recovery in a Distributed System
IEEE Transactions on Software Engineering
On the expressive power of priorities in CHR
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
A Language for Large Ensembles of Independently Executing Nodes
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Constraint Handling Rules
Pregel: a system for large-scale graph processing
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Maintaining distributed logic programs incrementally
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Parallelizing union-find in constraint handling rules using confluence analysis
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Analyses, optimizations and extensions of constraint handling rules: ph.d. summary
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Concurrent goal-based execution of constraint handling rules
Theory and Practice of Logic Programming
Compiling CHR to parallel hardware
Proceedings of the 14th symposium on Principles and practice of declarative programming
| Hi-index | 0.00 |
CHR is a declarative, concurrent and committed choice rule-based constraint programming language. In this paper, we adapt CHR to provide a decentralized execution model for parallel and distributed programs. Specifically, we consider an execution model consisting of an ensemble of computing entities, each with its own constraint store and each capable of communicating with its neighbors. We extend CHR into CHRe, in which rules are executed at a location and are allowed to access the constraint store of its immediate neighbors. We give an operational semantics for CHRe, denoted ω0e, that defines incremental and asynchronous decentralized rewriting for the class of CHRe rules characterized by purely local matching (0-neighbor restricted rules). We show the soundness of the ω0e semantics with respect to the abstract CHR semantics. We then give a safe encoding of the more general 1-neighbor restricted rules as 0-neighbor restricted rules, and discuss how this encoding can be generalized to all CHRe programs.