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
Journal ArticleDOI
Fast deterministic selection on mesh-connected processor arrays
TL;DR: An algorithm for the three-dimensional mesh which achieves a time bound better than any of the previously known deterministic results is presented.
Proceedings ArticleDOI
Period-time tradeoffs for VLSI models with delay
TL;DR: The VLSI model is classified in two categories one with drivers and the other without and period-time tradeoffs and lower bounds on time for the computation of transitive functions on these models are investigated.
Proceedings ArticleDOI
On the power of randomization for the common PRAM
TL;DR: The results provide the first broad demonstration of the power of randomization for the COMMON model, and the first log-star COMMON algorithms for a number of fundamental problems.
Book ChapterDOI
Parallel machines and their communication theoretical limits
TL;DR: This overview cannot be complete, nor did it try to present any technical details, so the interested reader is encouraged to look into the cited literature.
Journal ArticleDOI
Control Localization in Networks of Dynamical Systems Connected via a Weighted Tree
Ravindra B. Bapat,Chai Wah Wu +1 more
TL;DR: This work abstracts the problem of which system to apply control in the case when only a single system receives control into a study of eigenvalues of a perturbed Laplacian matrix, and shows that this eigenvalue problem has a complete solution for arbitrarily large control.