Parallel execution of multi-set constraint rewrite rules

Sulzmann, Martin; Lam, Edmund S. L.

doi:10.1145/1389449.1389453

Cited by 6 publications

(8 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first example of parallel implementation was due to Frühwirth [9] where it was shown how to evaluate the degree of concurrency starting from the confluence analysis of a sequential program execution. Further works by Sulzmann and Lam [16,28] focus on the formal specification and the development of a parallel implementation of the CHR goal-based execution schema: multiple processor cores run multiple threads following a single CHR goal. Other attempts to exploit concurrency in CHR were pursued in the last years, mainly driven by the CHR set-based operational semantics [21].…”

Section: Related Workmentioning

confidence: 99%

Compiling CHR to parallel hardware

Triossi

Orlando

Raffaetà

et al. 2012

Proceedings of the 14th Symposium on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

This paper investigates the compilation of a committed-choice rulebased language, Constraint Handling Rules (CHR), to specialized hardware circuits. The developed hardware is able to turn the intrinsic concurrency of the language into parallelism. Rules are applied by a custom executor that handles constraints according to the best degree of parallelism the implemented CHR specification can offer.Our framework deploys the target digital circuits through the Field Programmable Gate Array (FPGA) technology, by first compiling the CHR code fragment into a low level hardware description language.We also discuss the realization of a hybrid CHR interpreter, consisting of a software component running on a general purpose processor, coupled with a hardware accelerator. The latter unburdens the processor by executing in parallel the most computational intensive CHR rules directly compiled in hardware. Finally the performance of a prototype system is evaluated by time efficiency measures.

show abstract

Section: Related Workmentioning

confidence: 99%

Compiling CHR to parallel hardware

Triossi

Orlando

Raffaetà

et al. 2012

Proceedings of the 14th Symposium on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

show abstract

“…In our earlier works (Lam and Sulzmann 2007;Sulzmann and Lam 2008) we have developed a parallel CHR implementation scheme based on an informally described concurrent goal-based execution scheme (see Section 3 in Sulzmann and Lam 2008). The present works provides a concise formal treatment of the implemented concurrent goal-based execution scheme.…”

Section: From Concurrent To Parallel Constraint Handling Rules Executionmentioning

confidence: 99%

“…Atomic CHR execution is guaranteed via advanced synchronization primitives such as Software Transactional Memory. We refer to Sulzmann and Lam (2008) for a thorough description of the more subtle implementation details. Our experimental results reported in Sulzmann and Lam (2008) show that we achieve good scalability when the number of processor cores increases.…”

Section: From Concurrent To Parallel Constraint Handling Rules Executionmentioning

confidence: 99%

“…We refer to Sulzmann and Lam (2008) for a thorough description of the more subtle implementation details. Our experimental results reported in Sulzmann and Lam (2008) show that we achieve good scalability when the number of processor cores increases. The overhead of the parallel implementation is fairly minor compared to a single-threaded implementations thanks to the use of lock-free algorithms.…”

Section: From Concurrent To Parallel Constraint Handling Rules Executionmentioning

confidence: 99%

“…Section 4 contains the details. A concrete parallel implementation derived from our concurrent semantics is studied elsewhere (Sulzmann and Lam 2008). Section 5.2 provides a summary.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Concurrent goal-based execution of Constraint Handling Rules

Lam¹,

Sulzmann²

2010

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

We introduce a systematic, concurrent execution scheme for Constraint Handling Rules (CHR) based on a previously proposed sequential goal-based CHR semantics. We establish strong correspondence results to the abstract CHR semantics, thus guaranteeing that any answer in the concurrent, goal-based CHR semantics is reproducible in the abstract CHR semantics. Our work provides the foundation to obtain efficient, parallel CHR execution schemes.

show abstract

Constraint Handling Rules - What Else?

Frühwirth

2015

Rule Technologies: Foundations, Tools, and Applications

View full text Add to dashboard Cite

Abstract. Constraint Handling Rules (CHR) is both an effective concurrent declarative constraint-based programming language and a versatile computational formalism. While conceptually simple, CHR is distinguished by a remarkable combination of desirable features:-a semantic foundation in classical and linear logic, -an effective and efficient sequential and parallel execution model -guaranteed properties like the anytime online algorithm properties -powerful analysis methods for deciding essential program properties. This overview of some CHR-related research and applications is by no means meant to be complete. Essential introductory reading for CHR provide the survey article [125] and the books [56,63]. Up-to-date information on CHR can be found online at the CHR web-page www. constraint-handling-rules.org, including the slides of the keynote talk associated with this article. In addition, the CHR website dtai. cs.kuleuven.be/CHR/ offers everything you want to know about CHR, including online demo versions and free downloads of the language. Executive SummaryConstraint Handling Rules (CHR) [56] tries to bridge the gap between theory and practice, between logical specification and executable program by abstraction through constraints and the concepts of computational logic. CHR has its roots in constraint logic programming and concurrent constraint programming, but also integrates ideas from multiset transformation and rewriting systems as well as automated reasoning and theorem proving. It seamlessly blends multi-headed rewriting and concurrent constraint logic programming into a compact userfriendly rule-based programming language. CHR consists of guarded reactive rules that transform multisets of relations called constraints until no more change occurs. By the notion of constraint, CHR does not need to distinguish between data and operations, and its rules are both descriptive and executable.In CHR, one distinguishes two main kinds of rules: Simplification rules replace constraints by simpler constraints while preserving logical equivalence, e.g., X≤Y∧Y≤X ⇔ X=Y. Propagation rules add new constraints that are logically redundant but may cause further simplification, e.g., X≤Y∧Y≤Z ⇒ X≤Z. Together with X≤X ⇔ true, these rules encode the axioms of a partial order relation. The rules compute its transitive closure and replace inequalities ≤ by equalities = whenever possible. For example, A≤B∧B≤C∧C≤A becomes A=B∧B=C. More program examples can be found in Section 2. Semantics of CHR are discussed in Section 3.

show abstract

Parallel execution of multi-set constraint rewrite rules

Cited by 6 publications

References 16 publications

Compiling CHR to parallel hardware

Compiling CHR to parallel hardware

Concurrent goal-based execution of Constraint Handling Rules

Constraint Handling Rules - What Else?

Contact Info

Product

Resources

About