Location of Repository

Compilers Must Speak Properties, Not Just Code CAL: Constraint Aggregation Language for Declarative Component-Coordination

By Raimund Kirner, Frank Penczek and Alex Shafarenko

Abstract

This is a work-in-progress presentation in which we will argue that approaches based on components coordinated declaratively, such as S-Net, are ideally placed for automatic multicore optimisation. We will present our case for a component compiler producing not only object code, but also symbolic constraints describing the functional, and more importantly extra-functional, properties of the source component, such as computational complexity, resource and configuration requirements. We also argue that if the coordination language is well structured, which is easily achievable when it is declarative, it is possible to aggregate the constraints yielded by the components stage-wise and to represent the multicore optimisation problem in standard CSP form to use general-purpose constraint solvers. The use of symbolic constraints to describe system behaviour is shown by some examples of S-Net network combinators. If successful our approach will achieve an unprecedented degree of flexibility in programming for a wide range of heterogeneous multi-/many-core architectures. We would like to initiate a discussion on the interplay of constraint solving and declarative coordination programming. Categories and Subject Descriptors third-leve

Topics: technology
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.372.5420
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://homepages.feis.herts.ac... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.