|
ABSTRACT
Multi-set constraint rewriting allows for a highly parallel computational model and has been used in a multitude of application domains such as constraint solving, agent specification etc. Rewriting steps can be applied simultaneously as long as they do not interfere with each other.We wish that the underlying constraint rewrite implementation executes rewrite steps in parallel on increasingly popular becoming multi-core architectures. We design and implement efficient algorithms which allow for the parallel execution of multi-set constraint rewrite rules. Our experiments show that we obtain some significant speed-ups on multi-core architectures
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
S. Abdennadher. Operational semantics and confluence of constraint propagation rules. In Proc. of CP¿97, LNCS, pages 252--266. Springer-Verlag, 1997.
|
| |
2
|
G. J. Duck. Compilation of Constraint Handling Rules. PhD thesis, The University of Melbourne, 2005.
|
| |
3
|
G. J. Duck, P. J. Stuckey, M. J. García de la Banda, and C. Holzbaur. The refined operational semantics of Constraint Handling Rules. In Proc of ICLP'04, volume 3132 of LNCS, pages 90--104. Springer-Verlag, 2004.
|
| |
4
|
C. Forgy. A fast algorithm for the many patterns/many objects match problem. Artificial Intelligence, 19(1):17--37, 1982.
|
| |
5
|
T. Frühwirth. Theory and practice of constraint handling rules. Journal of Logic Programming, Special Issue on Constraint Logic Programming, 37(1-3):95--138, 1998.
|
| |
6
|
T. Frühwirth. Parallelizing union-find in Constraint Handling Rules using confluence analysis. In Proc. of ICLP'05, volume 3668 of LNCS, pages 113--127. Springer-Verlag, 2005.
|
 |
7
|
|
| |
8
|
Glasgow haskell compiler home page. http://www.haskell.org/ghc/.
|
 |
9
|
A. Gupta , C. Forgy , A. Newell , R. Wedig, Parallel algorithms and architectures for rule-based systems, Proceedings of the 13th annual international symposium on Computer architecture, p.28-37, June 02-05, 1986, Tokyo, Japan
|
| |
10
|
|
| |
11
|
|
 |
12
|
|
| |
13
|
L. De Koninck, P.J. Stuckey, and G.J. Duck. Optimizing compilation of CHR with rule priorities. In Proc. of FLOPS'08, 2008. To appear.
|
| |
14
|
The K.U. Leuven CHR System. http://www.cs.kuleuven.be/~toms/Research/CHR.
|
 |
15
|
|
 |
16
|
Simon Marlow , Tim Harris , Roshan P. James , Simon Peyton Jones, Parallel generational-copying garbage collection with a block-structured heap, Proceedings of the 7th international symposium on Memory management, June 07-08, 2008, Tucson, AZ, USA
[doi> 10.1145/1375634.1375637]
|
| |
17
|
C. Perfumo, N. Sonmez, O. S. Unsal, A. Cristal, M. Valero, and T. Harris. Dissecting transactional executions in Haskell. In The Second ACM SIGPLAN Workshop on Transactional Computing (TRANSACT), 2007.
|
| |
18
|
T. Schrijvers. Analyses, optimizations and extensions of Constraint Handling Rules: Ph.D. summary. In Proc. of ICLP'05, volume 3668 of LNCS, pages 435--436. Springer-Verlag, 2005.
|
| |
19
|
M. Stahl. Implementing CHR with STM, March 2007. personal communication.
|
| |
20
|
P. Van Weert, T. Schrijvers, and B. Demoen. K.U.Leuven JCHR: a user-friendly, flexible and efficient CHR system for Java. In Proc. of Second Workshop on Constraint Handling Rules, pages 47--62, 2005.
|
|