PARTANS
Authors:
Open Access
- 20 January 2013
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 9 (4) , 1-24
Abstract
GPGPUs are a powerful and energy-efficient solution for many problems. For higher performance or larger problems, it is necessary to distribute the problem across multiple GPUs, increasing the already high programming complexity. In this article, we focus on abstracting the complexity of multi-GPU programming for stencil computation. We show that the best strategy depends not only on the stencil operator, problem size, and GPU, but also on the PCI express layout. This adds nonuniform characteristics to a seemingly homogeneous setup, causing up to 23% performance loss. We address this issue with an autotuner that optimizes the distribution across multiple GPUs.Keywords
This publication has 10 references indexed in Scilit:
- Towards High-Level Programming of Multi-GPU Systems Using the SkelCL Library2012
- PADS: A Pattern-Driven Stencil Compiler-Based Tool for Reuse of Optimizations on GPGPUs2011
- Physis2011
- Mint2011
- Auto-tuning SkePU2011
- PATUS: A Code Generation and Autotuning Framework for Parallel Iterative Stencil Computations on Modern Microarchitectures2011
- Achieving a single compute device image in OpenCL for multiple GPUs2011
- A design pattern language for engineering (parallel) software2010
- Exploring the multiple-GPU design space2009
- Stencils and Problem Partitionings: Their Influence on the Performance of Multiple Processor SystemsIEEE Transactions on Computers, 1987