ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Synergistic Execution of Stream Programs on Multicores with Accelerators

Udupa, Abhishek and Govindarajan, R and Thazhuthaveetil, Matthew J (2009) Synergistic Execution of Stream Programs on Multicores with Accelerators. In: ACM Sigplan Notices, 44 (7). pp. 99-108.

[img] PDF
pdf.pdf - Published Version
Restricted to Registered users only

Download (893Kb) | Request a copy
Official URL: http://portal.acm.org/citation.cfm?id=1542466

Abstract

The StreamIt programming model has been proposed to exploit parallelism in streaming applications oil general purpose multicore architectures. The StreamIt graphs describe task, data and pipeline parallelism which can be exploited on accelerators such as Graphics Processing Units (GPUs) or CellBE which support abundant parallelism in hardware. In this paper, we describe a novel method to orchestrate the execution of if StreamIt program oil a multicore platform equipped with an accelerator. The proposed approach identifies, using profiling, the relative benefits of executing a task oil the superscalar CPU cores and the accelerator. We formulate the problem of partitioning the work between the CPU cores and the GPU, taking into account the latencies for data transfers and the required buffer layout transformations associated with the partitioning, as all integrated Integer Linear Program (ILP) which can then be solved by an ILP solver. We also propose an efficient heuristic algorithm for the work-partitioning between the CPU and the GPU, which provides solutions which are within 9.05% of the optimal solution on an average across the benchmark Suite. The partitioned tasks are then software pipelined to execute oil the multiple CPU cores and the Streaming Multiprocessors (SMs) of the GPU. The software pipelining algorithm orchestrates the execution between CPU cores and the GPU by emitting the code for the CPU and the GPU, and the code for the required data transfers. Our experiments on a platform with 8 CPU cores and a GeForce 8800 GTS 512 GPU show a geometric mean speedup of 6.94X with it maximum of 51.96X over it single threaded CPU execution across the StreamIt benchmarks. This is a 18.9% improvement over it partitioning strategy that maps only the filters that cannot be executed oil the GPU - the filters with state that is persistent across firings - onto the CPU.

Item Type: Journal Article
Additional Information: Copyrights of this article belongs to Association for Computing Machinery.
Keywords: CUDA; GPU Programming; Software Pipelining; Stream Programming; Partitioning
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 29 Dec 2009 10:02
Last Modified: 19 Sep 2010 05:40
URI: http://eprints.iisc.ernet.in/id/eprint/22087

Actions (login required)

View Item View Item