Please use this identifier to cite or link to this item:
|Title:||A concurrent constraint handling rules implementation in Haskell with software transactional memory||Authors:||Lam, E.S.L.
|Keywords:||Parallel implementation of concurrent language||Issue Date:||2007||Citation:||Lam, E.S.L.,Sulzmann, M. (2007). A concurrent constraint handling rules implementation in Haskell with software transactional memory. Conference Record of the Annual ACM Symposium on Principles of Programming Languages : 19-24. ScholarBank@NUS Repository. https://doi.org/10.1145/1248648.1248653||Abstract:||Constraint Handling Rules (CHR) is a concurrent committed-choice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (atomic formulae). CHR is widely used in a range of applications spanning from type system design to artificial intelligence. However, none of the existing CHR implementations we are aware of exploits concurrency or parallelism explicitly. We give a concurrent CHR implementation using GHC (Glasgow Haskell Compiler) with support for Software Transactional Memory. We achieve some significant performance improvements compared to a single-threaded CHR implementation. We obtain a further speed-up, in some cases nearly close to the optimum of 100%, when running programs under under a dual-core processor architecture. Our results show that CHR can be implemented efficiently on a multi-core architecture. Copyright 2007 ACM.||Source Title:||Conference Record of the Annual ACM Symposium on Principles of Programming Languages||URI:||http://scholarbank.nus.edu.sg/handle/10635/40348||ISBN:||1595936904||ISSN:||07308566||DOI:||10.1145/1248648.1248653|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 1, 2020
checked on Mar 31, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.