Efficient Selection Algorithms on Distributed Memory Computers
Published in Conference on High Performance Computing (Supercomputing) • Nov 7, 1998
Authors:,
E. L. G. Saukas
S. W. Song
Abstract
Consider the selection problem of determining the k th smallest element of a sequence of n elements. Under the CGM (Coarse Grained Multicomputer) model with p processors and O (n/p) local memory, we present a deterministic parallel algorithm for the selection problem that requires O(log p) communica...
Subject
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!