Klaas Boesche

dblp:169/7043 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization › code generation › parallel code generation
accelerator code generation
0.312018
AnyDSL: a partial evaluation framework for programming high-performance libraries · Proc. ACM Program. Lang. 2018
Compilers and program optimization
code generation
0.312018
AnyDSL: a partial evaluation framework for programming high-performance libraries · Proc. ACM Program. Lang. 2018
Compilers and program optimization
partial evaluation
0.312018
AnyDSL: a partial evaluation framework for programming high-performance libraries · Proc. ACM Program. Lang. 2018
GPUs and heterogeneous computing › CPU-GPU heterogeneous computing
CPU-GPU code generation
0.112018
AnyDSL: a partial evaluation framework for programming high-performance libraries · Proc. ACM Program. Lang. 2018

Methods — techniques the papers use, named apart from their topics

online partial evaluation · 0.7higher-order functions · 0.7CPS-style intermediate representation · 0.7
YearPublicationVenuePosition
2018 AnyDSL: a partial evaluation framework for programming high-performance libraries
abstract
This paper advocates programming high-performance code using partial evaluation. We present a clean-slate programming system with a simple, annotation-based, online partial evaluator that operates on a CPS-style intermediate representation. Our system exposes code generation for accelerators (vectorization/parallelization for CPUs and GPUs) via compiler-known higher-order functions that can be subjected to partial evaluation. This way, generic implementations can be instantiated with target-specific code at compile time. In our experimental evaluation we present three extensive case studies from image processing, ray tracing, and genome sequence alignment. We demonstrate that using partial evaluation, we obtain high-performance implementations for CPUs and GPUs from one language and one code base in a generic way. The performance of our codes is mostly within 10%, often closer to the performance of multi man-year, industry-grade, manually-optimized expert codes that are considered to be among the top contenders in their fields.
Roland Leißa, Klaas Boesche, Sebastian Hack, Arsène Pérard-Gayot, Richard Membarth, Philipp Slusallek, André Müller, Bertil Schmidt
Proc. ACM Program. Lang.2
2015 Shallow embedding of DSLs via online partial evaluation
abstract
This paper investigates shallow embedding of DSLs by means of online partial evaluation. To this end, we present a novel online partial evaluator for continuation-passing style languages. We argue that it has, in contrast to prior work, a predictable termination policy that works well in practice. We present our approach formally using a continuation-passing variant of PCF and prove its termination properties. We evaluate our technique experimentally in the field of visual and high-performance computing and show that our evaluator produces highly specialized and efficient code for CPUs as well as GPUs that matches the performance of hand-tuned expert code.
Roland Leißa, Klaas Boesche, Sebastian Hack, Richard Membarth, Philipp Slusallek
GPCE2