August Ernstsson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
August Ernstsson has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Christoph Kessler
Linköping University
10 shared publications - Dalvan Griebler
Pontifical Catholic University of Rio Grande do Sul (PUCRS)
2 shared publications - Alexander Lindskog
Department of Computer and Information Science, Linköping University, Linköping, Sweden
1 shared publication - Anton Borg
Blekinge Institute of Technology
1 shared publication - August Svensson
Department of Computer and Information Science, Linköping University, Linköping, Sweden
1 shared publication - Björn Birath
PELAB, Department of Computer and Information Science, Linköping University, Linköping, Sweden
1 shared publication
Latest Publications
- Open Access
- 1 August 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 59 (8) , 39-49
General Purpose AI Computing: Opportunities and Challenges
- 1 August 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 59 (8) , 39-49
Open AccessGeneral Purpose AI Computing: Opportunities and Challenges
- Open Access
- 16 April 2026
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 54 (1-2) , 7
SkePU-Streaming: Distributed Pipelining of Portable Data-Parallel Skeleton Computations for the Heterogeneous Edge-Cloud Continuum
We present SkePU-Streaming, a two-layer high-level programming framework for specifying complex pipelines composed of portable multi-backend stream processing tasks, each expressed by algorithmic skeletons or user-provided implementations, and its deployment toolchain for distributed heterogeneous parallel systems. Pipeline tasks can have multiple implementation variants to more flexibly exploit the resources of heterogeneous nodes; the convenient expression of multi-variant tasks is achieved by integrating the high-level C++-based skeleton programming framework SkePU with its multiple backends as the main method for portable programming of the stream-processing tasks. Concretely, SkePU-Streaming adds an abstraction layer for pipeline workflow specifications atop SkePU-based task specifications. It extends the SkePU data-container API with stream access operators for use within SkePU and other C++ task code. We present the SkePU-Streaming design and its implementation in a deployment framework for distributed heterogeneous parallel systems, and demonstrate its use with two different video processing applications.
- 16 April 2026
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 54 (1-2) , 7
Open AccessSkePU-Streaming: Distributed Pipelining of Portable Data-Parallel Skeleton Computations for the Heterogeneous Edge-Cloud Continuum
We present SkePU-Streaming, a two-layer high-level programming framework for specifying complex pipelines composed of portable multi-backend stream processing tasks, each expressed by algorithmic skeletons or user-provided implementations, and its deployment toolchain for distributed heterogeneous parallel systems. Pipeline tasks can have multiple implementation variants to more flexibly exploit the resources of heterogeneous nodes; the convenient expression of multi-variant tasks is achieved by integrating the high-level C++-based skeleton programming framework SkePU with its multiple backends as the main method for portable programming of the stream-processing tasks. Concretely, SkePU-Streaming adds an abstraction layer for pipeline workflow specifications atop SkePU-based task specifications. It extends the SkePU data-container API with stream access operators for use within SkePU and other C++ task code. We present the SkePU-Streaming design and its implementation in a deployment framework for distributed heterogeneous parallel systems, and demonstrate its use with two different video processing applications.
- Open Access
- 1 October 2025
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 53 (5) , 29
Interactive Performance Visualization and Analysis of Execution Traces for Pattern-Based Parallel Programming
We introduce the design and implementation of a performance visualization system for high-level programming of heterogeneous parallel systems. The system consists of an execution trace extension to the algorithmic skeleton programming framework SkePU and an interactive tool that visualizes the execution trace as a graph model with a connected source code browser. The main contribution of the work lies in addressing the gap of performance analysis and debugging for programming of parallel and heterogeneous architectures at high abstraction levels, where the tool should present information at the same level of abstraction as the programming model itself. We evaluate the work by usability user surveys, observations, and interviews of novice to intermediate-level SkePU users. Additionally, we conduct performance evaluation to quantify the overhead of execution tracing of SkePU programs. Finally, we evaluate how trace lengths impact responsiveness and interactivity of the visualization tool and apply it to a larger program for training convolutional neural network models.
- 1 October 2025
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 53 (5) , 29
Open AccessInteractive Performance Visualization and Analysis of Execution Traces for Pattern-Based Parallel Programming
We introduce the design and implementation of a performance visualization system for high-level programming of heterogeneous parallel systems. The system consists of an execution trace extension to the algorithmic skeleton programming framework SkePU and an interactive tool that visualizes the execution trace as a graph model with a connected source code browser. The main contribution of the work lies in addressing the gap of performance analysis and debugging for programming of parallel and heterogeneous architectures at high abstraction levels, where the tool should present information at the same level of abstraction as the programming model itself. We evaluate the work by usability user surveys, observations, and interviews of novice to intermediate-level SkePU users. Additionally, we conduct performance evaluation to quantify the overhead of execution tracing of SkePU programs. Finally, we evaluate how trace lengths impact responsiveness and interactivity of the visualization tool and apply it to a larger program for training convolutional neural network models.
- Open Access
- 27 May 2024
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 52 (4) , 253-273
High-Level Programming of FPGA-Accelerated Systems with Parallel Patterns
As a result of frequency and power limitations, multi-core processors and accelerators are becoming more and more prevalent in today’s systems. To fully utilize such systems, heterogeneous parallel programming is needed, but this introduces new complexities to the development. High-level frameworks such as SkePU have been introduced to help alleviate these complexities. SkePU is a skeleton programming framework based on a set of programming constructs implementing computational parallel patterns, while presenting a sequential interface to the programmer. Using the various skeleton backends, SkePU programs can execute, without source code modification, on multiple types of hardware such as CPUs, GPUs, and clusters. This paper presents the design and implementation of a new backend for SkePU, adding support for FPGAs. We also evaluate the effect of FPGA-specific optimizations in the new backend and compare it with the existing GPU backend, where the actual devices used are of similar vintage and price point. For simple examples, we find that the FPGA-backend’s performance is similar to that of the existing backend for GPUs, while it falls behind in more complex tasks. Finally, some shortcomings in the backend are highlighted and discussed, along with potential solutions.
- 27 May 2024
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 52 (4) , 253-273
Open AccessHigh-Level Programming of FPGA-Accelerated Systems with Parallel Patterns
As a result of frequency and power limitations, multi-core processors and accelerators are becoming more and more prevalent in today’s systems. To fully utilize such systems, heterogeneous parallel programming is needed, but this introduces new complexities to the development. High-level frameworks such as SkePU have been introduced to help alleviate these complexities. SkePU is a skeleton programming framework based on a set of programming constructs implementing computational parallel patterns, while presenting a sequential interface to the programmer. Using the various skeleton backends, SkePU programs can execute, without source code modification, on multiple types of hardware such as CPUs, GPUs, and clusters. This paper presents the design and implementation of a new backend for SkePU, adding support for FPGAs. We also evaluate the effect of FPGA-specific optimizations in the new backend and compare it with the existing GPU backend, where the actual devices used are of similar vintage and price point. For simple examples, we find that the FPGA-backend’s performance is similar to that of the existing backend for GPUs, while it falls behind in more complex tasks. Finally, some shortcomings in the backend are highlighted and discussed, along with potential solutions.
- Open Access
- 6 December 2022
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 51 (1) , 61-82
Assessing Application Efficiency and Performance Portability in Single-Source Programming for Heterogeneous Parallel Systems
We analyze the performance portability of the skeleton-based, single-source multi-backend high-level programming framework SkePU across multiple different CPU–GPU heterogeneous systems. Thereby, we provide a systematic application efficiency characterization of SkePU-generated code in comparison to equivalent hand-written code in more low-level parallel programming models such as OpenMP and CUDA. For this purpose, we contribute ports of the STREAM benchmark suite and of a part of the NAS Parallel Benchmark suite to SkePU. We show that for STREAM and the EP benchmark, SkePU regularly scores efficiency values above 80% and in particular for CPU systems, SkePU can outperform hand-written code.
- 6 December 2022
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 51 (1) , 61-82
Open AccessAssessing Application Efficiency and Performance Portability in Single-Source Programming for Heterogeneous Parallel Systems
We analyze the performance portability of the skeleton-based, single-source multi-backend high-level programming framework SkePU across multiple different CPU–GPU heterogeneous systems. Thereby, we provide a systematic application efficiency characterization of SkePU-generated code in comparison to equivalent hand-written code in more low-level parallel programming models such as OpenMP and CUDA. For this purpose, we contribute ports of the STREAM benchmark suite and of a part of the NAS Parallel Benchmark suite to SkePU. We show that for STREAM and the EP benchmark, SkePU regularly scores efficiency values above 80% and in particular for CPU systems, SkePU can outperform hand-written code.
- 1 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 229-232
Analyzing Programming Effort Model Accuracy of High-Level Parallel Programs for Stream Processing
Over the years, several Parallel Programming Models (PPMs) have supported the abstraction of programming complexity for parallel computer systems. However, few studies aim to evaluate the productivity reached by such abstractions since this is a complex task that involves human beings. There are several studies to develop predictive methods to estimate the effort required to develop software applications. In order to evaluate the reliability of such metrics, it is necessary to assess the accuracy in different programming paradigms. In this work, we used the data of an experiment conducted with beginners in parallel programming to determine the effort required for implementing stream parallelism using FastFlow, SPar, and TBB. Our results show that some traditional software effort estimation models, such as COCOMO II, fall short. In contrast, Planning Poker could contribute toward a parallel-aware effort model.
- 1 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 229-232
Analyzing Programming Effort Model Accuracy of High-Level Parallel Programs for Stream Processing
Over the years, several Parallel Programming Models (PPMs) have supported the abstraction of programming complexity for parallel computer systems. However, few studies aim to evaluate the productivity reached by such abstractions since this is a complex task that involves human beings. There are several studies to develop predictive methods to estimate the effort required to develop software applications. In order to evaluate the reliability of such metrics, it is necessary to assess the accuracy in different programming paradigms. In this work, we used the data of an experiment conducted with beginners in parallel programming to determine the effort required for implementing stream parallelism using FastFlow, SPar, and TBB. Our results show that some traditional software effort estimation models, such as COCOMO II, fall short. In contrast, Planning Poker could contribute toward a parallel-aware effort model.
- Open Access
- 22 March 2022
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 50 (3-4) , 319-340
A Deterministic Portable Parallel Pseudo-Random Number Generator for Pattern-Based Programming of Heterogeneous Parallel Systems
SkePU is a pattern-based high-level programming model for transparent program execution on heterogeneous parallel computing systems. A key feature of SkePU is that, in general, the selection of the execution platform for a skeleton-based function call need not be determined statically. On single-node systems, SkePU can select among CPU, multithreaded CPU, single or multi-GPU execution. Many scientific applications use pseudo-random number generators (PRNGs) as part of the computation. In the interest of correctness and debugging, deterministic parallel execution is a desirable property, which however requires a deterministically parallelized pseudo-random number generator. We present the API and implementation of a deterministic, portable parallel PRNG extension to SkePU that is scalable by design and exhibits the same behavior regardless where and with how many resources it is executed. We evaluate it with four probabilistic applications and show that the PRNG enables scalability on both multi-core CPU and GPU resources, and hence supports the universal portability of SkePU code even in the presence of PRNG calls, while source code complexity is reduced.
- 22 March 2022
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 50 (3-4) , 319-340
Open AccessA Deterministic Portable Parallel Pseudo-Random Number Generator for Pattern-Based Programming of Heterogeneous Parallel Systems
SkePU is a pattern-based high-level programming model for transparent program execution on heterogeneous parallel computing systems. A key feature of SkePU is that, in general, the selection of the execution platform for a skeleton-based function call need not be determined statically. On single-node systems, SkePU can select among CPU, multithreaded CPU, single or multi-GPU execution. Many scientific applications use pseudo-random number generators (PRNGs) as part of the computation. In the interest of correctness and debugging, deterministic parallel execution is a desirable property, which however requires a deterministically parallelized pseudo-random number generator. We present the API and implementation of a deterministic, portable parallel PRNG extension to SkePU that is scalable by design and exhibits the same behavior regardless where and with how many resources it is executed. We evaluate it with four probabilistic applications and show that the PRNG enables scalability on both multi-core CPU and GPU resources, and hence supports the universal portability of SkePU code even in the presence of PRNG calls, while source code complexity is reduced.
- 15 March 2022
- Published by Linkoping University Electronic Press
Pattern-based Programming Abstractions for Heterogeneous Parallel Computing
Contemporary computer architectures utilize wide multi-core processors, accelerators such as GPUs, and clustering of individual computers into complex large-scale systems. These hardware trends are ...
- 15 March 2022
- Published by Linkoping University Electronic Press
Pattern-based Programming Abstractions for Heterogeneous Parallel Computing
Contemporary computer architectures utilize wide multi-core processors, accelerators such as GPUs, and clustering of individual computers into complex large-scale systems. These hardware trends are ...
- Open Access
- 19 May 2021
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 49 (6) , 846-866
SkePU 3: Portable High-Level Programming of Heterogeneous Systems and HPC Clusters
We present the third generation of the C++-based open-source skeleton programming framework SkePU. Its main new features include new skeletons, new data container types, support for returning multiple objects from skeleton instances and user functions, support for specifying alternative platform-specific user functions to exploit e.g. custom SIMD instructions, generalized scheduling variants for the multicore CPU backends, and a new cluster-backend targeting the custom MPI interface provided by the StarPU task-based runtime system. We have also revised the smart data containers’ memory consistency model for automatic data sharing between main and device memory. The new features are the result of a two-year co-design effort collecting feedback from HPC application partners in the EU H2020 project EXA2PRO, and target especially the HPC application domain and HPC platforms. We evaluate the performance effects of the new features on high-end multicore CPU and GPU systems and on HPC clusters.
- 19 May 2021
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 49 (6) , 846-866
Open AccessSkePU 3: Portable High-Level Programming of Heterogeneous Systems and HPC Clusters
We present the third generation of the C++-based open-source skeleton programming framework SkePU. Its main new features include new skeletons, new data container types, support for returning multiple objects from skeleton instances and user functions, support for specifying alternative platform-specific user functions to exploit e.g. custom SIMD instructions, generalized scheduling variants for the multicore CPU backends, and a new cluster-backend targeting the custom MPI interface provided by the StarPU task-based runtime system. We have also revised the smart data containers’ memory consistency model for automatic data sharing between main and device memory. The new features are the result of a two-year co-design effort collecting feedback from HPC application partners in the EU H2020 project EXA2PRO, and target especially the HPC application domain and HPC platforms. We evaluate the performance effects of the new features on high-end multicore CPU and GPU systems and on HPC clusters.
- Open Access
- 26 November 2020
- Published by Linkoping University Electronic Press
Designing a Modern Skeleton Programming Framework for Parallel and Heterogeneous Systems
Today's society is increasingly software-driven and dependent on powerful computer technology. Therefore it is important that advancements in the low-level processor hardware are made available for ...
- 26 November 2020
- Published by Linkoping University Electronic Press
Open AccessDesigning a Modern Skeleton Programming Framework for Parallel and Heterogeneous Systems
Today's society is increasingly software-driven and dependent on powerful computer technology. Therefore it is important that advancements in the low-level processor hardware are made available for ...