Work

A Work-Efficient Step-Efficient Prefix Sum Algorithm

Year: 2006

Type: article

Abstract: The Prefix-sum algorithm [Hillis and Steele Jr. 1986] is one of the most important building blocks for data-parallel computation. Its applications include parallel implementations of deleting marked elements from an array (stream-compaction), radix-sort, solving recurrence equations, solving tri-diagonal linear systems, and quicksort. In addition to being a useful building block, the prefix-sum algorithm is a good example of a computation that seems inherently sequential, but for which there are efficient data-parallel algorithms.

Source: eScholarship (California Digital Library)

Authors: Shubhabrata Sengupta, Aaron Lefohn, John D. Owens

Institution: University of California, Davis

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1227119782

FWCI: 7.081

Cites: 2

Cited by: 69

Related to: 10