Journal ArticleDOI
Parallelism in Comparison Problems
Reads0
Chats0
TLDR
The worst-case time complexity of algorithms for multiprocessor computers with binary comparisons as the basic operations is investigated and the algorithm for finding the maximum is shown to be optimal for all values of k and n.Abstract:
The worst-case time complexity of algorithms for multiprocessor computers with binary comparisons as the basic operations is investigated. It is shown that for the problems of finding the maximum, sorting, and merging a pair of sorted lists, if n, the size of the input set, is not less than k, the number of processors, speedups of at least $O(k/\log \log k)$ can be achieved with respect to comparison operations. The algorithm for finding the maximum is shown to be optimal for all values of k and n.read more
Citations
More filters
Book
Finding effective 'force-targets' for two-dimensional multifinger frictional grips
TL;DR: Techniques from computational geometry are applied to solve several problems in grasp planning and control in robotics, including the problem of calculating “force targets” for a collection of n fingers which grasp a two-dimensional object at known positions.
Journal ArticleDOI
Approximating Huffman Codes in Parallel
TL;DR: This paper presents the first parallel algorithm that constructs exact Huffman codes with maximum codeword length H in time O(H) with n/logn processors, if the elements are sorted.
Book ChapterDOI
Leaders Election Without Conflict Resolution Rule - Fast and Efficient Randomized Simulations among CRCW PRAMs
TL;DR: In this article, a randomized simulation of MAXIMUM (a very strong CRCW PRAM) on TOLERANT is presented, which runs in nearly doubly logarithmic time and linear space.
Journal ArticleDOI
Lower bounds on parallel algorithms for finding the first maximal independent set
Journal ArticleDOI
Sorting-based selection algorithms for hypercubic networks
TL;DR: The fastest algorithm for selecting the k th largest record from a set of n records on any n -node hypercubic network is presented, very nearly matching the trivial $\Omega(\lg n)$ lower bound.