A work-efficient step-efficient prefix sum algorithm, in: Workshop on Edge Computing Using New Commodity Architectures (2006)
by
Shubhabrata Sengupta
,
Aaron E. Lefohn
,
John D. Owens
| Citations: | 15 - 4 self |
BibTeX
@MISC{Sengupta06awork-efficient,
author = {Shubhabrata Sengupta and Aaron E. Lefohn and John D. Owens},
title = {A work-efficient step-efficient prefix sum algorithm, in: Workshop on Edge Computing Using New Commodity Architectures},
year = {2006}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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
Citations
| 213 | Data parallel algorithms - Hillis, Steele - 1986 |
| 79 | Prefix sums and their applications - Blelloch - 1990 |
