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
Parallel Techniques for Paths, Visibility, and Related Problems (Thesis)
TL;DR: In this article, the authors presented several deterministic techniques for efficiently solving shortest paths, visibility, and other related geometric problems in parallel, including triangulating monotone polygons and star-shaped polygons.
Journal ArticleDOI
A new parallel algorithm for time-slot assignment in hierarchical switching systems
TL;DR: A new parallel algorithm for the TSA problem in hierarchical switching systems (HSS) is developed and it is shown how this reduction can be achieved in polylogarithmic time using a polynomial number of processors on the EREW PRAM model.
Journal ArticleDOI
Determining Weak Visibility of a Polygon from an Edge in Parallel
TL;DR: This paper presents an optimal parallel algorithm for solving the problem of determining the weak visibility of an n-vertex simple polygon P from an edge e of P, and shows how to solve optimally, in parallel, several other problems that are related to theWeak visibility of simple polygons.
Computation-efficient parallel prefix
TL;DR: A new algorithm can achieve linear speedup and is cost-optimal when n = (p 2 log p) and the prefix problem of n inputs using p p 3 is required.
Proceedings Article
Two families of parallel prefix algorithms for multicomputers
Li-Ling Hung,Yen-Chun Lin +1 more
TL;DR: Two families of computation-efficient parallel prefix algorithms for message-passing multicomputer models are presented that provide the flexibility of choosing either less computation time or less communication time to achieve the minimal running time.