Journal ArticleDOI
The power of parallel prefix
Reads0
Chats0
TLDR
This study assumes the weakest PRAM model, where shared memory locations can only be exclusively read or written (the EREW model) to solve the prefix computation problem, when the order of the elements is specified by a linked list.Abstract:
The prefix computation problem is to compute all n initial products a1* . . . *a1,i=1, . . ., n of a set of n elements, where * is an associative operation. An O(((logn) log(2n/p))XI(n/p)) time deterministic parallel algorithm using p≤n processors is presented to solve the prefix computation problem, when the order of the elements is specified by a linked list. For p≤O(n1-e)(e〉0 any constant), this algorithm achieves linear speedup. Such optimal speedup was previously achieved only by probabilistic algorithms. This study assumes the weakest PRAM model, where shared memory locations can only be exclusively read or written (the EREW model).read more
Citations
More filters
Book ChapterDOI
On Parallel Sorting and Addition with Concurrent Writes
TL;DR: An algorithm to add N-bit numbers in O(lg N/lglg N) time if all bits of a number can be set independently in parallel achieves optimal (linear) speed-up.
Proceedings ArticleDOI
Parallel algorithms for maximum matching in interval graphs
TL;DR: This work presents parallel algorithms for computing maximum cardinality matchings among pairs of disjoint intervals in interval graphs an the EREW PRAM and hypercube models and presents an improved parallel algorithm for maximum matching between overlapping intervals in proper interval graphs.
Journal ArticleDOI
Parallel integer sorting using small operations
TL;DR: It is shown thatn integers in the range [0,n c -1] can be sorted in O(logn) time withO(nlogn)O(1)-bit operations andO(n) O( logn)-bit ops, and the speed of the proposed algorithm is optimal.
Journal ArticleDOI
Work-Stealing Prefix Scan: Addressing Load Imbalance in Large-Scale Image Registration
TL;DR: In this paper , a hierarchical prefix scan algorithm was proposed to reduce the time of registration of a series of electron microscopy images to less than 3 minutes by translating the image registration into a specific instance of the prefix scan.
Journal ArticleDOI
A parallel Poisson generator using parallel prefix
TL;DR: A parallel Poisson random number generator is designed based on this algorithm and prefix computation and achieves linear speedup when p is small and the average time complexity is O(log(mμ)) when p are O(m μ).