Sorting-based selection algorithms for hypercubic networks


Journal Article

This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based on the selection algorithm of Cole and Yap, as well as on various sorting algorithms for hypercubic networks. Our fastest algorithm runs in O(lg n lg* n) time, very nearly matching the trivial Ω(lg n) lower bound. Previously, the best upper bound known for selection was O(lg n lg lg n). A key subroutine in our O(lg n lg* n) time selection algorithm is a sparse version of the Sharesort algorithm that sorts n records using p processors, p ≥ n, in O (lg n (lg lg p - lg lg(p/n))2) time.

Full Text

Duke Authors

Cited Authors

  • Berthomé, P; Ferreira, A; Maggs, BM; Perennes, S; Plaxton, CG

Published Date

  • January 1, 2000

Published In

Volume / Issue

  • 26 / 2

Start / End Page

  • 237 - 254

International Standard Serial Number (ISSN)

  • 0178-4617

Digital Object Identifier (DOI)

  • 10.1007/s004539910011

Citation Source

  • Scopus