Journal ArticleDOI
The power of parallel prefix
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
Parallel solutions of Simple Indexed Recurrence equations
Yosi Ben-Asher,Gady Haber +1 more
TL;DR: A practical and a more improved version of the non-optimal algorithm for SIR presented in [1] which uses repeated iterations of pointer jumping and shows that pointer jumping requires O(n) work in most practical cases of SIR loops, thus forming a more practical solution.
Journal ArticleDOI
K-Dimensional Optimal Parallel Algorithm for the solution of a general class of recurrence equations
Qingshi Gao,Zhiyong Liu +1 more
TL;DR: This paper proposes a parallel algorithm, called KDOP (K-Dimensional Optimal Parallel algorithm), to solve a general class of recurrence equations efficiently, and can be implemented on machines with multiple processing elements or pipelined vector machines with parallel memory systems.
Journal ArticleDOI
An Improved Parallel Prefix Sums Algorithm
Hatem M. Bahig,Khaled Fathy +1 more
TL;DR: An improvement for the best previous algorithm that runs in formula time using processors on a Sum Concurrent Read Concurrent Write, Parallel Random Access Machine (Sum-CRCW PRAM) is introduced.
Book ChapterDOI
Parallel Grid Adaptation
TL;DR: A unified parallel algorithm for grid adaptation by local refinement/coarsening is presented, employed for dynamic adaptation of 3-D, unstructured tetrahedral grids on a partitioned memory MIMD architecture.
Proceedings ArticleDOI
Parallel algorithm for direct domination on nonoverlapping rectangles
TL;DR: The author presents a parallel algorithm for a computational geometry problem which is motivated by the constraint graph used in compaction of VLSI circuits, and has time complexity O(log/sup 2/ n), using n/log n processors, in the CREW-PRAM (parallel random access machine) model.