RPL: A Domain-Specific Language for Designing and Implementing Parallel C++ Applications

Janjić, Vladimir; Brown, Christopher; MacKenzie, Kenneth; Hammond, Kevin; Danelutto, Marco; Aldinucci, Marco; García, Javier Avilés

doi:10.1109/pdp.2016.122

Cited by 17 publications

(16 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We have tested our prototype on four standard benchmark programs: matrix multiplication, n-body, n-queens, and sumeuler, demonstrating that it can successfully expose the underlying recursion schemes. The corresponding parallel implementations achieve maximum speedups of 32.93 (21.66 using physical cores) for matrix multiplication, 27.08 (23.46 using physical cores) for n-body, 22.65 (20.48 using physical cores) for n-queens, and 30.50 (22.24 using physical cores) for sumeuler, on a 28-core hyper-threaded experimental testbed machine. Our technique is not restricted to Haskell, or to a specific set of recursion schemes, but is, in principle, completely general.…”

Section: Novel Contributionsmentioning

confidence: 99%

See 1 more Smart Citation

Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification

Barwell

Brown

Hammond

2018

Future Generation Computer Systems

View full text Add to dashboard Cite

Please cite this article as: A.D. Barwell, C. Brown, K. Hammond, Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification, Future Generation Computer Systems (2017), http://dx. AbstractThis paper describes a new technique for identifying potentially parallelisable code structures in functional programs. Higher-order functions enable simple and easily understood abstractions that can be used to implement a variety of common recursion schemes, such as maps and folds over traversable data structures. Many of these recursion schemes have natural parallel implementations in the form of algorithmic skeletons. This paper presents a technique that detects instances of potentially parallelisable recursion schemes in Haskell 98 functions. Unusually, we exploit anti-unification to expose these recursion schemes from source-level definitions whose structures match a recursion scheme, but which are not necessarily written directly in terms of maps, folds, etc. This allows us to automatically introduce parallelism, without requiring the programmer to structure their code a priori in terms of specific higher-order functions. We have implemented our approach in the Haskell refactoring tool, HaRe, and demonstrated its use on a range of common benchmarking examples. Using our technique, we show that recursion schemes can be easily detected, that parallel implementations can be easily introduced, and that we can achieve real parallel speedups (up to 23.79× the sequential performance on 28 physical cores, or 32.93× the sequential performance with hyper-threading enabled).

show abstract

Section: Novel Contributionsmentioning

confidence: 99%

“…Many implementations of these skeletons exist, e.g. [1,7,8,12,11,19,21,22,23], with some for multiple architectures such as GPUs, e.g. [5,13,24].…”

Section: Algorithmic Skeletons and Structured Parallelismmentioning

confidence: 99%

Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification

Barwell

Brown

Hammond

2018

Future Generation Computer Systems

View full text Add to dashboard Cite

show abstract

“…In a structured parallelism setting, Janjic et al [25] define a high-level DSL, the Refactoring Pattern Language (RPL), that aims to represent the parallel structure of a program, and capture its execution time. This DSL is a powerful tool, since it allows suitable parallelisations to be found for a given program, and then to apply them to a real C++ program.…”

Section: Related Workmentioning

confidence: 99%

Automatically deriving cost models for structured parallel processes using hylomorphisms

Castro

Hammond

Sarkar

et al. 2018

Future Generation Computer Systems

View full text Add to dashboard Cite

Please cite this article as: D. Castro, et al., Automatically deriving cost models for structured parallel processes using hylomorphisms, Future Generation Computer Systems (2017), http://dx.doi.org/10.1016/j.future. 2017.04.035 This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. An operational semantics of a queue language for streaming computations.  An operational semantics of algorithmic skeletons using this queue language.  Derive cost equations for algorithmic skeletons from the operational semantics.  Cost equations for algorithmic skeletons are combined with sized types. AbstractStructured parallelism using nested algorithmic skeletons can greatly ease the task of writing parallel software, since common, but hard-to-debug, problems such as race conditions are eliminated by design. However, choosing the best combination of algorithmic skeletons to yield good parallel speedups for a specific program on a specific parallel architecture is still a difficult problem. This paper uses the unifying notion of hylomorphisms, a general recursion pattern, to make it possible to reason about both the functional correctness properties and the extra-functional timing properties of structured parallel programs. We have previously used hylomorphisms to provide a denotational semantics for skeletons, and proved that a given parallel structure for a program satisfies functional correctness. This paper expands on this theme, providing a simple operational semantics for algorithmic skeletons and a cost semantics that can be automatically derived from that operational semantics. We prove that both semantics are sound with respect to our previously defined denotational semantics. This means that we can now automatically and statically choose a provably optimal parallel structure for a given program with respect to a cost model for a (class of) parallel architecture. By deriving an automatic amortised analysis from our cost model, we can also accurately predict parallel runtimes and speedups.

show abstract

“…To raise the level of abstraction in parallel software development for specific application domains, some research works proposed domain-specific languages (DSLs) built on top of pattern-based frameworks [10,41,56]. Their main aim is to help the domain experts to easily prototype different parallel variants of their code and to introduce parallel runtime optimizations in a more selective way.…”

Section: Parallel Pattern-based Approachesmentioning

confidence: 99%

Bringing Parallel Patterns Out of the Corner

Sensi

Matteis

Torquati

et al. 2017

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

High-level parallel programming is an active research topic aimed at promoting parallel programming methodologies that provide the programmer with high-level abstractions to develop complex parallel software with reduced time to solution. Pattern-based parallel programming is based on a set of composable and customizable parallel patterns used as basic building blocks in parallel applications. In recent years, a considerable effort has been made in empowering this programming model with features able to overcome shortcomings of early approaches concerning flexibility and performance. In this article, we demonstrate that the approach is flexible and efficient enough by applying it on 12 out of 13 PARSEC applications. Our analysis, conducted on three different multicore architectures, demonstrates that pattern-based parallel programming has reached a good level of maturity, providing comparable results in terms of performance with respect to both other parallel programming methodologies based on pragma-based annotations (i.e., OpenMP and OmpSs) and native implementations (i.e., Pthreads). Regarding the programming effort, we also demonstrate a considerable reduction in lines of code and code churn compared to Pthreads and comparable results with respect to other existing implementations. We extended this work by (i) modeling and implementing an additional seven applications by using parallel patterns (there were five in Danelutto et al. [21]), (ii) implementing four of these applications with another framework (SkePU), (iii) comparing our approach to the OmpSs programming model, (iv) adding other programmability metrics to our analysis, and (v) testing our work on two additional and completely different architectures.

show abstract

RPL: A Domain-Specific Language for Designing and Implementing Parallel C++ Applications

Cited by 17 publications

References 19 publications

Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification

Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification

Automatically deriving cost models for structured parallel processes using hylomorphisms

Bringing Parallel Patterns Out of the Corner

Contact Info

Product

Resources

About