Skip to main content
Log in

A Note on Parallel Selection on Coarse-Grained Multicomputers

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

Consider the selection problem of determining the k th smallest element of a set 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) communication rounds. Besides requiring a low number of communication rounds, the algorithm also attempts to minimize the total amount of data transmitted in each round (only O(p) except in the last round). In addition to showing theoretical complexities, we present very promising experimental results obtained on a parallel machine that show almost linear speedup, indicating the efficiency and scalability of the proposed algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received June 1, 1997; revised March 10, 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Saukas, E., Song, S. A Note on Parallel Selection on Coarse-Grained Multicomputers . Algorithmica 24, 371–380 (1999). https://doi.org/10.1007/PL00008268

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00008268

Navigation