O(log*n) algorithms on a Sum-CRCW PRAM

Authors:
S. C. Eisenstat
Affiliations:
Yale University, Department of Computer Science, P. O. Box 208285, 06520-8285, New Haven, CT, USA
Venue:
Computing
Year:
2007

Two families of parallel prefix algorithms for multicomputers

TELE-INFO'08 Proceedings of the 7th WSEAS International Conference on Telecommunications and Informatics
Parallel prefix algorithms on the multicomputer

WSEAS Transactions on Computer Research
New parallel prefix algorithms

AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
New families of computation-efficient parallel prefix algorithms

WSEAS Transactions on Computers
Sorting, searching, and simulation in the mapreduce framework

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

Hi-index	0.00

We present work- and cost-optimal O(log*n) algorithms for prefix sums and linear integer sorting on a Sum-CRCW PRAM.