Optimal deterministic approximate parallel prefix sums and their applications

Authors:
Affiliations:
Venue:
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Year:
1995

Citing 0
Cited 13

Provably efficient scheduling for languages with fine-grained parallelism

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Faster output-sensitive parallel convex hulls for d≤3: optimal sublogarithmic algorithms for small outputs

Proceedings of the twelfth annual symposium on Computational geometry
Parallel multidimensional search using approximation algorithms: with applications to linear-programming and related problems

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Deterministic restrictions in circuit complexity

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Construction of 1-d lower envelopes and applications

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Provably efficient scheduling for languages with fine-grained parallelism

Journal of the ACM (JACM)
Fixed-dimensional parallel linear programming via relative &egr;-approximations

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Deterministic parallel backtrack search

Theoretical Computer Science
Improving the efficiency of parallel minimum spanning tree algorithms

Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Approximate Compaction and Padded-Sorting on Exclusive Write PRAMs

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Improved Deterministic Parallel Padded Sorting

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Distribution-sensitive algorithms

Nordic Journal of Computing
Improving parallel computation with fast integer sorting

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: We show that extremely accurate approximation to the prefix sums of a sequence of n integers can be computed deterministically in O(log log n) time using O(n/log log n) processors in the COMMON CRCW PRAM model. This complements randomized approximation methods obtained recently by Goodrich, Matias and Vishkin, (1993) and improves previous deterministic results obtained by Hagerup and Raman. Furthermore, our results completely match a lower bound obtained recently by Chaudhuri. Our results have many applications. Using them we improve upon the best known time bounds for deterministic approximate selection and for deterministic padded sorting.