|
|
| Title | A Work-Efficient Step-Efficient Prefix Sum Algorithm
(In Proceedings) |
|---|
| in | Proceedings of the 2006 Workshop on Edge Computing Using New Commodity Architectures |
|---|
|
| Author(s) |
Shubhabrata Sengupta, Aaron Lefohn, John D. Owens |
|---|
|
| Year |
May 2006
|
|---|
| Location | Chapel Hill, NC |
|---|
| Date | May 23--24, 2006 |
|---|
|
| Pages | D-26--27 |
|---|
|
| Download |  |
|---|
|
| BibTeX |  |
|---|
|
|
| Note |
This material is based upon work supported by the National Science Foundation under an NSF Graduate Research Fellowship and Grant #0541448, DOE Early Career Principal Investigator Award DE-FG02-04ER25609, LANL, Chevron, and UC MICRO.
|
|---|
|
