Optimal and efficient algorithms for summing and prefix summing on parallel machines

Journal of Parallel and Distributed Computing

Volumn 62, Issue 4, 2002, Pages 517-543

  Santos, Eunice E ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036106373     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2000.1698     Document Type: Article

References (19)

1. Designing broadcasting algorithms in the postal model for message-passing systems
2. Faster optimal parallel prefix sums and list ranking
3. LogP: A Practical Model of Parallel Computation
4. Towards a single model of efficient computation in real parallel machines
5. Parallel prefix computation with few processors
6. The parallel complexity of integer prefix summation
7. Parallel tree contraction and prefix computations on a large family of interconnection topologies
8. Optimal broadcast and summation on the LogP model
9. Parallel algorithms for shared-memory machines
10. The power of parallel prefix
11. Parallel prefix computation
12. "Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes"
13. Efficient parallel prefix algorithms on multiport message-passing systems
14. Prefix-sums algorithms on reconfigurable meshes
15. Towards an architecture-independent analysis of parallel algorithms
16. Optimal and efficient parallel algorithms for summing and prefix summing
17. On parallel prefix computation
18. An efficient parallel algorithm for the solution of tridiagonal linear system of equations
19. Data broadcasting and reduction, prefix computation, and sorting on reduced hypercube parallel computers