Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Wait-free parallel algorithms for the union-find problem
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Parallel algorithms for evaluating sequences of set-manipulation operations
Journal of the ACM (JACM)
A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Essentials of Constraint Programming
Essentials of Constraint Programming
Essentials of Constraint Programming
Essentials of Constraint Programming
Introduction to the Special Issue on Constraint Handling Rules
Theory and Practice of Logic Programming
Optimal union-find in Constraint Handling Rules
Theory and Practice of Logic Programming
Proceedings of the 2007 ACM symposium on Applied computing
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Proceedings of the 2007 workshop on Declarative aspects of multicore programming
Proceedings of the 5th conference on Computing frontiers
Parallel execution of multi-set constraint rewrite rules
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Theory of finite or infinite trees revisited
Theory and Practice of Logic Programming
Transactions in Constraint Handling Rules
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Complexity of a CHR solver for existentially quantified conjunctions of equations over trees
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
A complete and terminating execution model for constraint handling rules
Theory and Practice of Logic Programming
Analysing graph transformation systems through constraint handling rules
Theory and Practice of Logic Programming
Concurrent goal-based execution of constraint handling rules
Theory and Practice of Logic Programming
Complete propagation rules for lexicographic order constraints over arbitrary domains
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Compiling CHR to parallel hardware
Proceedings of the 14th symposium on Principles and practice of declarative programming
Diagrammatic confluence for constraint handling rules*
Theory and Practice of Logic Programming
Decentralized execution of constraint handling rules for ensembles
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
Constraint Handling Rules is a logical concurrent committed-choice rule-based language. Recently it was shown that the classical union-find algorithm can be implemented in CHR with optimal time complexity. Here we investigate if a parallel implementation of this algorithm is also possible in CHR. The problem is hard for several reasons: - Up to now, no parallel computation model for CHR was defined. - Tarjan's optimal union-find is known to be hard to parallelize. - The parallel code should be as close as possible to the sequential one. It turns out that confluence analysis of the sequential implementation gives almost all the information needed to parallelize the union-find algorithm under a rather general parallel computation model for CHR.