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
Proceedings ArticleDOI
A new approach to constructing optimal prefix circuits with small depth
Yen-Chun Lin,Jun-Wei Hsiao +1 more
TL;DR: A new approach to designing a depth-size optimal parallel prefix circuit, WE4, with fan-out 4 and small depth is taken, which has many cases of n and has the smallest depth among all known prefix circuits.
Journal ArticleDOI
Parallel Algorithm for Finding the Most Vital Edge in Weighted Graphs
TL;DR: AnO(logn) time parallel algorithm with processors for finding the most vital edge of a graph on the concurrent read exclusive write (CREW) model of parallel computation.
Journal ArticleDOI
Fast parallel algorithms for the Maximum Empty Rectangle problem
TL;DR: This paper presents efficient parallel algorithms for the maximum empty rectangle problem on crew pram and anO(logn) time algorithm on a mesh-of-trees architecture.
Journal ArticleDOI
Parallel algorithms for testing if a point is inside a closed curve
Ling Tony Chen,Larry S. Davis +1 more
TL;DR: Two parallel algorithms to test whether a point is inside a digitized closed curve are described, each of which takes constant numbers of scan instructions.
Journal ArticleDOI
Some Algorithms for Synchronizing Clocks of Base Transceiver Stations in a Cellular Network
TL;DR: This paper presents and compares several algorithms that can be used for solving synchronization problems arising in the context of cellular networks.