On probabilistic networks for selection, merging, and sorting

Tom Leighton, Yuan Ma, Torsten Suel

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We study comparator networks for selection, merging, and sorting that output the correct result with high probability given a random input permutation. We prove tight bounds, up to constant factors, on the size and depth of probabilistic (n, k)-selection networks. In the case of (n, n/2)-selection, our result gives a somewhat surprising bound of Θ(n log log n) on the size of networks of success probability in [δ, 1 - 1/poly(n)], where δ is an arbitrarily small positive constant, thus comparing favorably with the best previously known solutions, which have size Θ(n log n). We also prove tight bounds, up to lower order terms, on the size and depth of probabilistic merging networks of success probability in [δ, 1 - 1/poly(n)], where δ is an arbitrarily small positive constant. Finally, we describe two fairly simple probabilistic sorting networks of success probability at least 1 - 1/poly(n) and nearly logarithmic depth.

    Original languageEnglish (US)
    Title of host publicationAnnual ACM Symposium on Parallel Algorithms and Architectures
    Place of PublicationNew York, NY, United States
    PublisherACM
    Pages106-118
    Number of pages13
    StatePublished - 1995
    EventProceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'95 - Santa Barbara, CA, USA
    Duration: Jul 17 1995Jul 19 1995

    Other

    OtherProceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'95
    CitySanta Barbara, CA, USA
    Period7/17/957/19/95

    Fingerprint

    Sorting
    Merging

    ASJC Scopus subject areas

    • Software
    • Safety, Risk, Reliability and Quality

    Cite this

    Leighton, T., Ma, Y., & Suel, T. (1995). On probabilistic networks for selection, merging, and sorting. In Annual ACM Symposium on Parallel Algorithms and Architectures (pp. 106-118). New York, NY, United States: ACM.

    On probabilistic networks for selection, merging, and sorting. / Leighton, Tom; Ma, Yuan; Suel, Torsten.

    Annual ACM Symposium on Parallel Algorithms and Architectures. New York, NY, United States : ACM, 1995. p. 106-118.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Leighton, T, Ma, Y & Suel, T 1995, On probabilistic networks for selection, merging, and sorting. in Annual ACM Symposium on Parallel Algorithms and Architectures. ACM, New York, NY, United States, pp. 106-118, Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'95, Santa Barbara, CA, USA, 7/17/95.
    Leighton T, Ma Y, Suel T. On probabilistic networks for selection, merging, and sorting. In Annual ACM Symposium on Parallel Algorithms and Architectures. New York, NY, United States: ACM. 1995. p. 106-118
    Leighton, Tom ; Ma, Yuan ; Suel, Torsten. / On probabilistic networks for selection, merging, and sorting. Annual ACM Symposium on Parallel Algorithms and Architectures. New York, NY, United States : ACM, 1995. pp. 106-118
    @inproceedings{8431c43520ef426db0e53729d31dc94d,
    title = "On probabilistic networks for selection, merging, and sorting",
    abstract = "We study comparator networks for selection, merging, and sorting that output the correct result with high probability given a random input permutation. We prove tight bounds, up to constant factors, on the size and depth of probabilistic (n, k)-selection networks. In the case of (n, n/2)-selection, our result gives a somewhat surprising bound of Θ(n log log n) on the size of networks of success probability in [δ, 1 - 1/poly(n)], where δ is an arbitrarily small positive constant, thus comparing favorably with the best previously known solutions, which have size Θ(n log n). We also prove tight bounds, up to lower order terms, on the size and depth of probabilistic merging networks of success probability in [δ, 1 - 1/poly(n)], where δ is an arbitrarily small positive constant. Finally, we describe two fairly simple probabilistic sorting networks of success probability at least 1 - 1/poly(n) and nearly logarithmic depth.",
    author = "Tom Leighton and Yuan Ma and Torsten Suel",
    year = "1995",
    language = "English (US)",
    pages = "106--118",
    booktitle = "Annual ACM Symposium on Parallel Algorithms and Architectures",
    publisher = "ACM",

    }

    TY - GEN

    T1 - On probabilistic networks for selection, merging, and sorting

    AU - Leighton, Tom

    AU - Ma, Yuan

    AU - Suel, Torsten

    PY - 1995

    Y1 - 1995

    N2 - We study comparator networks for selection, merging, and sorting that output the correct result with high probability given a random input permutation. We prove tight bounds, up to constant factors, on the size and depth of probabilistic (n, k)-selection networks. In the case of (n, n/2)-selection, our result gives a somewhat surprising bound of Θ(n log log n) on the size of networks of success probability in [δ, 1 - 1/poly(n)], where δ is an arbitrarily small positive constant, thus comparing favorably with the best previously known solutions, which have size Θ(n log n). We also prove tight bounds, up to lower order terms, on the size and depth of probabilistic merging networks of success probability in [δ, 1 - 1/poly(n)], where δ is an arbitrarily small positive constant. Finally, we describe two fairly simple probabilistic sorting networks of success probability at least 1 - 1/poly(n) and nearly logarithmic depth.

    AB - We study comparator networks for selection, merging, and sorting that output the correct result with high probability given a random input permutation. We prove tight bounds, up to constant factors, on the size and depth of probabilistic (n, k)-selection networks. In the case of (n, n/2)-selection, our result gives a somewhat surprising bound of Θ(n log log n) on the size of networks of success probability in [δ, 1 - 1/poly(n)], where δ is an arbitrarily small positive constant, thus comparing favorably with the best previously known solutions, which have size Θ(n log n). We also prove tight bounds, up to lower order terms, on the size and depth of probabilistic merging networks of success probability in [δ, 1 - 1/poly(n)], where δ is an arbitrarily small positive constant. Finally, we describe two fairly simple probabilistic sorting networks of success probability at least 1 - 1/poly(n) and nearly logarithmic depth.

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

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

    M3 - Conference contribution

    SP - 106

    EP - 118

    BT - Annual ACM Symposium on Parallel Algorithms and Architectures

    PB - ACM

    CY - New York, NY, United States

    ER -