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
Proceedings ArticleDOI
tDP: An Optimal-Latency Budget Allocation Strategy for Crowdsourced MAXIMUM Operations
TL;DR: This work provides a polynomial-time dynamic-programming budget allocation algorithm that minimizes the latency when questions form tournaments in each round and compares its approach to alternatives on Amazon Mechanical Turk, where many of its theory assumptions do not necessarily hold.
Journal ArticleDOI
Parallel Processing of Region Boundaries.
TL;DR: This paper presents parallel algorithms to determine properties of regions,such as area; to perform operations on regions, such as union and intersection; to determine if a point lies inside a region; and to determine whether a given digital curve could be the boundary of a region.
Journal ArticleDOI
L -infinity interdistance selection by parametric search
TL;DR: An algorithm is presented that selects the k th largest or smallest element from a Cartesian sum in O ( n log n ) time and is the first algorithm for a multidimensional interdistance selection problem with an O( n log O (1) n ) running time.
Journal ArticleDOI
On Parallel Integer Merging
Omer Berkman,Uzi Vishkin +1 more
TL;DR: The problem of merging two sorted arrays A = (a1, a2, ..., an1) and B = (b1, b2,..., bn2) is considered and an algorithm that runs in O(log log log s) time using n/log loglog s CREW PRAM processors (optimal speed-up) and O(ns?) space is presented.
Book ChapterDOI
Conservative Algorithms for Parallel and Sequential Integer Sorting
Yijie Han,Xiaojun Shen +1 more
TL;DR: A conservative CRCW parallel algorithm for integer sorting which sorts n integers from {0, 1, ..., m−1} in time O(n min(log log n, log log m/log n) using p processors is presented.