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
Journal ArticleDOI
Parallel Algorithms for Partitioning Sorted Sets and Related Problems
TL;DR: The complexity bounds of the parallel partition algorithm on the respective special cases match those of the optimal EREW PRAM algorithms for merging, sorting, and finding an approximate median.
Proceedings ArticleDOI
Tracking the behavior of an ideal output queued switch using an input queued switch with unity speedup
A. Gourgy,Ted H. Szymanski +1 more
TL;DR: Using the proposed metrics as design criteria, a suite of scheduling policies for IQ switches with unity speedup are presented that provide better performance than existing scheduling policies in the literature, with comparable complexity.
Journal ArticleDOI
Fast computation of continued fractions
TL;DR: An O (log n ) algorithm to compute the n th convergent of a periodic continued fraction is given, based on matrix representation of continued fractions, due to Milne-Thomson, which allows for the computation of first n convergents of a general continued fraction in O ( Log n ) time using O( n log n ) processors.
Efficient Distributed Queuing System Simulation
Tobias Kiesling,Thomas Krieger +1 more
TL;DR: This paper investigates an alternative approach based on the technique of time-parallel simulation with fix-up computations based on its simplicity and its suitability for efficient distributed simulation execution.