Result: Parallelizing union-find in constraint handling rules using confluence analysis

Title:
Parallelizing union-find in constraint handling rules using confluence analysis
Authors:
FRÜHWIRTH, Thorn
Source:
Logic programming (21st international conference, ICLP 2005, Sitges, Spain, October 2-5, 2005, proceedings)Lecture notes in computer science. :113-127
Publisher Information:
New York, NY: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 17 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Algorithme parallèle, Parallel algorithm, Algoritmo paralelo, Analyse séquentielle, Sequential analysis, Análisis secuencial, Calcul parallèle, Parallel computation, Cálculo paralelo, Confluence, Confluencia, Parallélisation, Parallelization, Paralelisacíon, Programmation concurrente par contrainte, Concurrent constraint programming, Programación concurrrente con restricción, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Sémantique opérationnelle, Operational semantics, Semantica operacional, Traitement contrainte, Constraint handling, Langage basé règle
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Faculty of Computer Science, University of Ulm, Germany
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17247011
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17247011
Database:
PASCAL Archive

Further Information

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.