login

Efficient conditional operations for data-parallel architectures

Published 11 November 2002
Ujval J. Kapasi, William J. Dally, Scott Rixner, Peter Mattson, John D. Owens, Brucek Khailany
Citations15

TL;DR

Conditional streams extend the range of applications that a data-parallel architecture can execute efficiently and speed up polygon rendering by a factor of 1.8 with the use of conditional streams.

Abstract

Many data-parallel applications, including emerging media applications, have regular structures that can easily be expressed as a series of arithmetic kernels operating on data streams. Data-parallel architectures are designed to exploit this regularity by performing the same operation on many data elements concurrently. However, applications containing data-dependent control constructs perform poorly on these architectures. Conditional streams convert these constructs into data-dependent data movement. This allows data-parallel architectures to efficiently execute applications with data-dependent control flow. Essentially, conditional streams extend the range of applications that a data-parallel architecture can execute efficiently. For example, polygon rendering speeds up by a factor of 1.8 with the use of conditional streams.

Keywords

Computer Science