Expressive array constructs in an embedded GPU kernel programming language

Claessen, Koen; Sheeran, Mary; Svensson, Bo Joel

doi:10.1145/2103736.2103740

Cited by 60 publications

(54 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These include our own Skel library [7], which is currently the only available skeleton library for Erlang. A recent alternative approach is to define an embedded domain-specific language (EDSL) [12,22], This can provide a structured approach to parallelism, similar to our approach using skeletons. Skeletons, however, have the advantage of representing language-independent patterns of parallelism, that can more easily be transferred to other language settings.…”

Section: Related Workmentioning

confidence: 99%

The Missing Link! A New Skeleton for Evolutionary Multi-agent Systems in Erlang

Stypka

Turek

Byrski

et al. 2017

Int J Parallel Prog

View full text Add to dashboard Cite

Evolutionary multi-agent systems (EMAS) play a critical role in many artificial intelligence applications that are in use today. In this paper, we present a new generic skeleton in Erlang for parallel EMAS computations. The skeleton enables us to capture a wide variety of concrete evolutionary computations that can exploit the same underlying parallel implementation. We demonstrate the use of our skeleton on two different evolutionary computing applications: (1) computing the minimum of the Rastrigin function; and (2) solving an urban traffic optimisation problem. We show that we can obtain very good speedups (up to 142.44× the sequential performance) B Christopher Brown

show abstract

Section: Related Workmentioning

confidence: 99%

The Missing Link! A New Skeleton for Evolutionary Multi-agent Systems in Erlang

Stypka

Turek

Byrski

et al. 2017

Int J Parallel Prog

View full text Add to dashboard Cite

show abstract

“…There are also tagless-final DSLs [6], where there is no early commitment to a specific embedding, but instead class overloading in used to specify the API. Several Haskell DSLs, including Feldspar [37] and Obsidian [8], reify the structure of monadic code [40,41] to generate external imperative code. Other DSLs, including CoPilot [38] and Ivory [24], use a shallow embedding of statements to capture the monadic structure.…”

Section: Other Related Workmentioning

confidence: 99%

The remote monad design pattern

et al. 2015

View full text Add to dashboard Cite

Remote Procedure Calls are expensive. This paper demonstrates how to reduce the cost of calling remote procedures from Haskell by using the remote monad design pattern, which amortizes the cost of remote calls. This gives the Haskell community access to remote capabilities that are not directly supported, at a surprisingly inexpensive cost.We explore the remote monad design pattern through six models of remote execution patterns, using a simulated Internet of Things toaster as a running example. We consider the expressiveness and optimizations enabled by each remote execution model, and assess the feasibility of our approach. We then present a full-scale case study: a Haskell library that provides a Foreign Function Interface to the JavaScript Canvas API. Finally, we discuss existing instances of the remote monad design pattern found in Haskell libraries.

show abstract

“…One of these types, Pull arrays, were already presented in section 3.2. The other type is Push arrays, a notion originally introduced in [5]. Push arrays shares many significant properties with Pull arrays: they can be fused just as easily, are efficiently parallelizeable, and have a Functor instance.…”

Section: Push Arraysmentioning

confidence: 99%

“…We have included Push arrays [5] in our implementation. The result is a simpler implementation of many array operations including stencil computations and although the user of our library must now use two different types of arrays we consider the resulting API to be easier to use.…”

Section: Introductionmentioning

confidence: 99%

An EDSL approach to high performance Haskell programming

Ankner

Svenningsson

2013

Proceedings of the 2013 ACM SIGPLAN Symposium on Haskell

View full text Add to dashboard Cite

This paper argues for a new methodology for writing high performance Haskell programs by using Embedded Domain Specific Languages.We exemplify the methodology by describing a complete library, meta-repa, which is a reimplementation of parts of the repa library. The paper describes the implementation of meta-repa and contrasts it with the standard approach to writing high performance libraries. We conclude that even though the embedded language approach has an initial cost of defining the language and some syntactic overhead it gives a more tailored programming model, stronger performance guarantees, better control over optimizations, simpler implementation of fusion and inlining and allows for moving type level programming down to value level programming in some cases. We also provide benchmarks showing that meta-repa is as fast, or faster, than repa.Furthermore, meta-repa also includes push arrays and we demonstrate their usefulness for writing certain high performance kernels such as FFT.

show abstract

Expressive array constructs in an embedded GPU kernel programming language

Cited by 60 publications

References 11 publications

The Missing Link! A New Skeleton for Evolutionary Multi-agent Systems in Erlang

The Missing Link! A New Skeleton for Evolutionary Multi-agent Systems in Erlang

The remote monad design pattern

An EDSL approach to high performance Haskell programming

Contact Info

Product

Resources

About