Towards a High-Level Implementation of Execution Primitives for Unrestricted, Independent And-Parallelism

Casas, Amadeo; Carro, Manuel; Hermenegildo, Manuel V.

doi:10.1007/978-3-540-77442-6_16

Cited by 5 publications

(10 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two motivations justify the use of these operators instead of &/2. Firstly, their implementation is (in our experience) actually easier to devise and maintain than the monolithic &/2 [8], and, secondly, the depoperators allow more freedom to the annotator (and to the programmer, if parallel code is written by hand) to express data dependencies and, therefore, to extract more potential parallelism. We will now illustrate this last point (the former is out of our current scope).…”

Section: Definition 2 Hmentioning

confidence: 98%

“…-Additionally, when a goal is known to have exactly one solution, we can use specialized versions of the dep-operators [8] which do not need to perform bookkeeping for backtracking (always complex in parallel implementations), and are thus more efficient.…”

Section: Non Order-preserving Annotation: the Uudg Algorithmmentioning

confidence: 99%

“…As execution platform we have used a high level implementation of the proposed parallelism primitives [8], which we have developed as an extension of the Ciao system. This implementation is an evolution and simplification of [12] which is based on raising the level of certain components to the level of the source language and keeping only some selected operations (related to thread handling, locking, etc.)…”

Section: Performance Evaluationmentioning

confidence: 99%

See 2 more Smart Citations

Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs

Casas

Carro

Hermenegildo

2008

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

Abstract. We present two new algorithms which perform automatic parallelization via source-to-source transformations. The objective is to exploit goal-level, unrestricted independent and-parallelism. The proposed algorithms use as targets new parallel execution primitives which are simpler and more flexible than the well-known &/2 parallel operator. This makes it possible to generate better parallel expressions by exposing more potential parallelism among the literals of a clause than is possible with &/2. The difference between the two algorithms stems from whether the order of the solutions obtained is preserved or not. We also report on a preliminary evaluation of an implementation of our approach. We compare the performance obtained to that of previous annotation algorithms and show that relevant improvements can be obtained.

show abstract

Section: Definition 2 Hmentioning

confidence: 98%

Section: Non Order-preserving Annotation: the Uudg Algorithmmentioning

confidence: 99%

Section: Performance Evaluationmentioning

confidence: 99%

See 1 more Smart Citation

Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs

Casas

Carro

Hermenegildo

2008

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

show abstract

“…These features are designed to be natural extensions of the underlying module system. -Concurrency, Parallelism, and Distributed Execution: other packages bring in extensive capabilities for expressing concurrency (including a concurrent, shared versión of the internal fact datábase which can be used for synchronization), distribution, and parallel execution [14,11,23]. A notion of "active objects" also allows compiling objects so that they are ultimately mapped to a standalone process, which can then be transparently accessed by the rest of an application.…”

Section: ?-Use_package(functional) ?-[321] = ~Nrev(x)mentioning

confidence: 99%

An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy

Hermenegildo¹,

Bueno²,

Carro³

et al. 2008

Concurrency, Graphs and Models

Self Cite

View full text Add to dashboard Cite

Abstract. We describe some of the novel aspects and motivations behind the design and implementation of the Ciao multiparadigm programming system. An important aspect of Ciao is that it provides the programmer with a large number of useful features from different programming paradigms and styles, and that the use of each of these features can be turned on and off at will for each program module. Thus, a given module may be using e.g. higher order functions and constraints, while another module may be using objects, predicates, and concurrency. Furthermore, the language is designed to be extensible in a simple and modular way. Another important aspect of Ciao is its programming environment, which provides a powerful preprocessor (with an associated assertion language) capable of statically finding non-trivial bugs, verifying that programs comply with specifications, and performing many types of program optimizations. Such optimizations produce code that is highly competitive with other dynamic languages or, when the highest levéis of optimization are used, even that of static languages, all while retaining the interactive development environment of a dynamic language. The environment also includes a powerful auto-documenter. The paper provides an informal overview of the language and program development environment. It aims at illustrating the design philosophy rather than at being exhaustive, which would be impossible in the format of a paper, pointing instead to the existing literature on the system.

show abstract

“…In [8], we proposed a high-level implementation that raised some of the main components of the implementation to the source level, and was able to exploit the flexibility provided by unrestricted and-parallelism (i.e., not limited to forkjoin operations). However, [8] provided a solution which is only valid for the parallel execution of goals which have exactly one solution each, thus avoiding some of the hardest implementation problems.…”

Section: Introductionmentioning

confidence: 99%

A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism

2008

Self Cite

View full text Add to dashboard Cite

Abstract. The growing popularity of multicore architectures has renewed interest in language-based approaches to the exploitation of parallelism. Logic programming has proved an interesting framework to this end, and there are parallel implementations which have achieved significant speedups, but at the cost of a quite sophisticated low-level machinery. This machinery has been found challenging to code and, specially, to maintain and expand. In this paper, we follow a different approach which adopts a higher level view by raising some of the core components of the implementation to the level of the source language. We briefly present an implementation model for independent and-parallelism which fully supports non-determinism through backtracking and provides flexible solutions for some of the main problems found in previous andparallel implementations. Our proposal is able to optimize the execution for the case of deterministic programs and to exploit unrestricted andparallelism, which allows exposing more parallelism among clause literals than fork-join-based proposals. We present performance results for an implementation, including data for benchmarks where and-parallelism is exploited in non-deterministic programs.

show abstract

Towards a High-Level Implementation of Execution Primitives for Unrestricted, Independent And-Parallelism

Cited by 5 publications

References 22 publications

Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs

Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs

An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy

A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism

Contact Info

Product

Resources

About