Optimal parallel selection has complexity O(Log Log N)

Miklós Ajtai, János Komlós, W. L. Steiger, E. Szemerédi

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

We show that in the deterministic comparison model for parallel computation, p = n processors can select the kth smallest item from a set of n numbers in O(log log n) parallel time. With this result all comparison tasks (selection, merging, sorting) now have upper and lower bounds of the same order in both random and deterministic models. This optimal time bound holds even if p = o(n).

Original languageEnglish
Pages (from-to)125-133
Number of pages9
JournalJournal of Computer and System Sciences
Volume38
Issue number1
DOIs
Publication statusPublished - 1989

Fingerprint

Model Comparison
Deterministic Model
Parallel Computation
Sorting
Merging
Upper and Lower Bounds

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Optimal parallel selection has complexity O(Log Log N). / Ajtai, Miklós; Komlós, János; Steiger, W. L.; Szemerédi, E.

In: Journal of Computer and System Sciences, Vol. 38, No. 1, 1989, p. 125-133.

Research output: Contribution to journalArticle

Ajtai, Miklós ; Komlós, János ; Steiger, W. L. ; Szemerédi, E. / Optimal parallel selection has complexity O(Log Log N). In: Journal of Computer and System Sciences. 1989 ; Vol. 38, No. 1. pp. 125-133.
@article{f5d68cda5d8e440595ab69319d7195e5,
title = "Optimal parallel selection has complexity O(Log Log N)",
abstract = "We show that in the deterministic comparison model for parallel computation, p = n processors can select the kth smallest item from a set of n numbers in O(log log n) parallel time. With this result all comparison tasks (selection, merging, sorting) now have upper and lower bounds of the same order in both random and deterministic models. This optimal time bound holds even if p = o(n).",
author = "Mikl{\'o}s Ajtai and J{\'a}nos Koml{\'o}s and Steiger, {W. L.} and E. Szemer{\'e}di",
year = "1989",
doi = "10.1016/0022-0000(89)90035-4",
language = "English",
volume = "38",
pages = "125--133",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - Optimal parallel selection has complexity O(Log Log N)

AU - Ajtai, Miklós

AU - Komlós, János

AU - Steiger, W. L.

AU - Szemerédi, E.

PY - 1989

Y1 - 1989

N2 - We show that in the deterministic comparison model for parallel computation, p = n processors can select the kth smallest item from a set of n numbers in O(log log n) parallel time. With this result all comparison tasks (selection, merging, sorting) now have upper and lower bounds of the same order in both random and deterministic models. This optimal time bound holds even if p = o(n).

AB - We show that in the deterministic comparison model for parallel computation, p = n processors can select the kth smallest item from a set of n numbers in O(log log n) parallel time. With this result all comparison tasks (selection, merging, sorting) now have upper and lower bounds of the same order in both random and deterministic models. This optimal time bound holds even if p = o(n).

UR - http://www.scopus.com/inward/record.url?scp=0024606011&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024606011&partnerID=8YFLogxK

U2 - 10.1016/0022-0000(89)90035-4

DO - 10.1016/0022-0000(89)90035-4

M3 - Article

AN - SCOPUS:0024606011

VL - 38

SP - 125

EP - 133

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 1

ER -