A Fast Selection Algorithm for Meshes with Multiple Broadcasting

Authors:
D. Bhagavathi;P. J. Looges;S. Olariu;J. L. Schwing;J. Zhang
Affiliations:
-;-;-;-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1994

Citing 8
Cited 8

Array processor with multiple broadcasting

Journal of Parallel and Distributed Computing
Connection autonomy in SIMD computers: a VLSI implementation

Journal of Parallel and Distributed Computing
Square meshes are not always optimal

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Efficient median finding and its application to two-variable linear programming on mesh-connected computers with multiple broadcasting

Journal of Parallel and Distributed Computing
A time-optimal multiple search algorithm on enhanced meshes, with applications

Journal of Parallel and Distributed Computing
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting

IEEE Transactions on Parallel and Distributed Systems
A Unifying Look at Semigroup Computations on Meshes with Multiple Broadcasting

PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe

Time-Optimal Domain-Specific Querying on Enhanced Meshes

IEEE Transactions on Parallel and Distributed Systems
Podality-Based Time-Optimal Computations on Enhanced Meshes

IEEE Transactions on Parallel and Distributed Systems
Time- and VLSI-Optimal Sorting on Enhanced Meshes

IEEE Transactions on Parallel and Distributed Systems
The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry

IEEE Transactions on Parallel and Distributed Systems
Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting

IEEE Transactions on Parallel and Distributed Systems
Square Meshes Are Not Optimal for Convex Hull Computation

IEEE Transactions on Parallel and Distributed Systems
Fast median-finding on mesh-connected computers with segmented buses

Nordic Journal of Computing
Parallel recognition and parsing on mesh connected computers with multiple broadcasting

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the fundamental algorithmic problems in computer science involves selecting thekth smallest element in a collection A of n elements. We propose an algorithm designmethodology to solve the selection problem on meshes with multiple broadcasting. Ourmethodology leads to a selection algorithm that runs in O(n/sup 1/8/(log n)/sup 3/4/))time on a mesh with multiple broadcasting of size n/sup 3/8/(log n)/sup 1/4//spltimes/n/sup 5/8//(log n)/sup 1/4/. This result is optimal over a large class of selectionalgorithms. Our result shows that just as for semigroup computations, selection can bedone faster on suitably chosen rectangular meshes than on square meshes.