An Improved Parallel Prefix Sums Algorithm
From MaRDI portal
Publication:6135727
Recommendations
- Faster optimal parallel prefix sums and list ranking
- scientific article; zbMATH DE number 1304056
- The parallel complexity of integer prefix summation
- Parallel general prefix computations with geometric, algebraic, and other applications
- Optimal computation of prefix sums on a binary tree of processors
Cites work
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- Complexity analysis and performance of double hashing sort algorithm
- Faster optimal parallel prefix sums and list ranking
- Integer merging on EREW PRAM
- ON THE POWER OF SOME PRAM MODELS
- \(O (\log^* n)\) algorithms on a Sum-CRCW PRAM
Cited in
(12)- Construction of algorithms for parallel addition in expanding bases via extending window method
- Faster optimal parallel prefix sums and list ranking
- A generalized parallel prefix sums algorithm for arbitrary size arrays
- Parallel general prefix computations with geometric, algebraic, and other applications
- Prefix computations on symmetric multiprocessors
- Fast parallel algorithm for prefix computation in multi-mesh architecture
- Optimal computation of prefix sums on a binary tree of processors
- scientific article; zbMATH DE number 5670033 (Why is no real title available?)
- Internal masked prefix sums and its connection to fully internal measurement queries
- scientific article; zbMATH DE number 6479070 (Why is no real title available?)
- Optimal and efficient algorithms for summing and prefix summing on parallel machines
- Multiple addition and prefix sum on a linear array with a reconfigurable pipelined bus system
This page was built for publication: An Improved Parallel Prefix Sums Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135727)
