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
Dissertation
Algorithmes parallèles auto-adaptatifs et applications
TL;DR: In this article, the authors propose an algorithm parallele statique optimal du calcul des prefixes, which minimizes the total number of operations of a program parallele under the assumption of a grain fin of type vol de travail.
Proceedings ArticleDOI
Data-parallel primitives for spatial operations using PM quadtrees
E.G. Heol,Hanan Samet +1 more
TL;DR: Data-parallel primitives for performing operations on the PM/sub 1/ quadtree and the bucket PMR quadtree are presented using the scan model and algorithms are described for building these two data structures that make use of these primitives.
Journal ArticleDOI
Processing border codes on a mesh-connected computer
Yubin Hung,Azriel Rosenfeld +1 more
TL;DR: Algorithms which compute border code representations for regions which are stored in a mesh-connected computer and process border codes in a variety of ways are presented.
Proceedings ArticleDOI
Parallel Prefix Polymorphism Permits Parallelization, Presentation a Proof
Jiahao Chen,Alan Edelman +1 more
TL;DR: It is shown that polymorphism has broad applicability far beyond computations for technical computing: parallelism in distributed computing, presentation of visualizations of runtime data flow, and proofs for formal verification of correctness.
Proceedings Article
Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
TL;DR: In this paper, the problem of computing the shortest weakly visible subedge of a simple polygon P is solved by finding a shortest line segment s on the boundary of P such that P is weaklyvisible from s (if s exists).