Parallelizing union-find in constraint handling rules using confluence analysis

Lecture Notes in Computer Science

Volumn 3668, Issue , 2005, Pages 113-127

  Frühwirth, Thom ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; CONCURRENT ENGINEERING; CONSTRAINT THEORY; DATA HANDLING; OPTIMAL CONTROL SYSTEMS;

CONFLUENCE ANALYSIS; OPTIMAL TIME COMPLEXITY; PARALLEL CODES; RULE-BASED LANGUAGES;

LOGIC PROGRAMMING;

EID: 27144518777     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11562931_11     Document Type: Conference Paper

References (17)

1. S. Abdennadher. Operational Semantics and Confluence of Constraint Propagation Rules. In Third International Conference on Principles and Practice of Constraint Programming, CP97, LNCS 1330. Springer, 1997.
2. S. Abdennadher, T. Frühwirth, and C. H. (Eds.). Special Issue on Constraint Handling Rules, Journal of Theory and Practice of Logic Programming (TPLP). Cambridge University Press, to appear 2005.
3. S. Abdennadher, T. Frühwirth, and H. Meuss. Confluence and Semantics of Constraint Simplification Rules. Constraints Journal, 4(2), 1999.
4. R. J. Anderson and H. Woll. Wait-free parallel algorithms for the union-find problem. In STOC'91: Proceedings of the twenty-third annual ACM symposium on Theory of computing, pages 370-380. ACM Press, Revision of November 1994.
5. M. J. Atallah, M. T. Goodrich, and S. R. Kosaraju. Parallel algorithms for evaluating sequences of set-manipulation operations. J. ACM, 41(6): 1049-1088, 1994.
6. G. J. Duck, P. J. Stuckey, M. G. de la Banda, and C. Holzbaur. The Refined Operational Semantics of Constraint Handling Rules. In B. Demoen and V. Lifschitz, editors, Proceedings of the 20th International Conference on Logic Programming, 2004.
7. T. Frühwirth. Theory and Practice of Constraint Handling Rules, Special Issue on Constraint Logic Programming. Journal of Logic Programming, pages 95-138, October 1998.
8. T. Frühwirth and S. Abdennadher. Essentials of Constraint Programming. Springer, 2003.
9. Z. Galil and G. F. Italiano. Data Structures and Algorithms for Disjoint Set Union Problems. ACM Comp. Surveys, 23(3):319ff, 1991.
10. M. C. Pinotti, V. A. Crupi, and S. K. Das. A parallel solution to the extended set union problem with unlimited backtracking. In IPPS'96: Proceedings of the 10th International Parallel Processing Symposium, pages 182-186, Washington, DC, USA, 1996. IEEE Computer Society.
11. V. A. Saraswat and M. Rinard. Concurrent constraint programming. In POPL'90: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 232-245, New York, NY, USA, 1990. ACM Press.
12. V. A. Saraswat, M. Rinard, and P. Panangaden. The semantic foundations of concurrent constraint programming. In POPL'91: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 333-352, New York, NY, USA, 1991. ACM Press.
13. T. Schrijvers and T. Frühwirth. Union-Find in CHR. Technical Report CW389, Department of Computer Science, K.U.Leuven, Belgium, July 2004.
14. T. Schrijvers and T. Frühwirth. Analysing the CHR Implementation of Union-Find. In 19th Workshop on (Constraint) Logic Programming (W(C)LP 2005). Ulmer Informatik-Berichte 2005-01, University of Ulm, Germany, February 2005.
15. T. Schrijvers and T. Frühwirth. CHR Website, www.cs.kuleuven.ac.be/ ~dtai/ projects/CHR/, May 2005.
16. T. Schrijvers and T. Frühwirth. Optimal Union-Find in Constraint Handling Rules, Programming Pearl. Journal of Theory and Practice of Logic Programming (TPLP), to appear.
17. R. E. Tarjan and J. van Leeuwen. Worst-case Analysis of Set Union Algorithms. J. ACM, 31(2):245-281, 1984.