Memory-constrained Vectorization and Scheduling of Dataflow Graphs for Hybrid CPU-GPU Platforms

TL;DR

This paper introduces vectorization and scheduling techniques for hybrid CPU-GPU systems that optimize throughput under memory constraints, demonstrated through a wireless communication case study.

Contribution

It proposes novel methods for vectorization and scheduling on dataflow graphs to enhance throughput while respecting system memory limits in embedded heterogeneous platforms.

Findings

Significant throughput improvements over previous methods.

Effective exploitation of multiple parallelism forms.

Successful application to a wireless OFDM receiver system.

Abstract

The increasing use of heterogeneous embedded systems with multi-core CPUs and Graphics Processing Units (GPUs) presents important challenges in effectively exploiting pipeline, task and data-level parallelism to meet throughput requirements of digital signal processing (DSP) applications. Moreover, in the presence of system-level memory constraints, hand optimization of code to satisfy these requirements is inefficient and error-prone, and can therefore, greatly slow down development time or result in highly underutilized processing resources. In this paper, we present vectorization and scheduling methods to effectively exploit multiple forms of parallelism for throughput optimization on hybrid CPU-GPU platforms, while conforming to system-level memory constraints. The methods operate on synchronous dataflow representations, which are widely used in the design of embedded systems for signal and information processing. We show that our novel methods can significantly improve system throughput compared to previous vectorization and scheduling approaches under the same memory constraints. In addition, we present a practical case-study of applying our methods to significantly improve the throughput of an orthogonal frequency division multiplexing (OFDM) receiver system for wireless communications.