On randomized and deterministic schemes for routing and sorting on fixed-connection networks

Torsten Suel

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

    Abstract

    We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on fixedconnection networks such as meshes, hypercubes or point-to-point networks. On the randomized side, we focus on the techniques of randomized routing and random sampling and their use in many algorithms, while our presentation of deterministic algorithms uses the example of the Columnsort algorithm to highlight techniques such as local sorting and deterministic sampling. We then demonstrate that there is a close relationship between the randomized and deterministic techniques presented, and illustrate how this relationship can be used to transform randomized into deterministic algorithms and vice versa. Our main objective here is to provide a more unified perspective on many of the algorithms in the literature, and we do not attempt to provide a complete survey of routing and sorting problems on parallel machines.

    Original languageEnglish (US)
    Title of host publicationParallel and Distributed Processing - 10 IPPS/SPDP 1998 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Proceedings
    PublisherSpringer Verlag
    Pages384-386
    Number of pages3
    Volume1388
    ISBN (Print)3540643591, 9783540643593
    StatePublished - 1998
    Event10 Workshops held in conjunction with 12th International Parallel Symposium and 9th Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998 - Orlando, United States
    Duration: Mar 30 1998Apr 3 1998

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume1388
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other10 Workshops held in conjunction with 12th International Parallel Symposium and 9th Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998
    CountryUnited States
    CityOrlando
    Period3/30/984/3/98

    Fingerprint

    Sorting
    Routing
    Deterministic Algorithm
    Random Sampling
    Sampling
    Parallel Machines
    Hypercube
    Mesh
    Transform
    Demonstrate
    Relationships

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Suel, T. (1998). On randomized and deterministic schemes for routing and sorting on fixed-connection networks. In Parallel and Distributed Processing - 10 IPPS/SPDP 1998 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Proceedings (Vol. 1388, pp. 384-386). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1388). Springer Verlag.

    On randomized and deterministic schemes for routing and sorting on fixed-connection networks. / Suel, Torsten.

    Parallel and Distributed Processing - 10 IPPS/SPDP 1998 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Proceedings. Vol. 1388 Springer Verlag, 1998. p. 384-386 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1388).

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

    Suel, T 1998, On randomized and deterministic schemes for routing and sorting on fixed-connection networks. in Parallel and Distributed Processing - 10 IPPS/SPDP 1998 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Proceedings. vol. 1388, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1388, Springer Verlag, pp. 384-386, 10 Workshops held in conjunction with 12th International Parallel Symposium and 9th Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998, Orlando, United States, 3/30/98.
    Suel T. On randomized and deterministic schemes for routing and sorting on fixed-connection networks. In Parallel and Distributed Processing - 10 IPPS/SPDP 1998 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Proceedings. Vol. 1388. Springer Verlag. 1998. p. 384-386. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Suel, Torsten. / On randomized and deterministic schemes for routing and sorting on fixed-connection networks. Parallel and Distributed Processing - 10 IPPS/SPDP 1998 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Proceedings. Vol. 1388 Springer Verlag, 1998. pp. 384-386 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{10607e8dbf9b4d16a0762dd184dae732,
    title = "On randomized and deterministic schemes for routing and sorting on fixed-connection networks",
    abstract = "We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on fixedconnection networks such as meshes, hypercubes or point-to-point networks. On the randomized side, we focus on the techniques of randomized routing and random sampling and their use in many algorithms, while our presentation of deterministic algorithms uses the example of the Columnsort algorithm to highlight techniques such as local sorting and deterministic sampling. We then demonstrate that there is a close relationship between the randomized and deterministic techniques presented, and illustrate how this relationship can be used to transform randomized into deterministic algorithms and vice versa. Our main objective here is to provide a more unified perspective on many of the algorithms in the literature, and we do not attempt to provide a complete survey of routing and sorting problems on parallel machines.",
    author = "Torsten Suel",
    year = "1998",
    language = "English (US)",
    isbn = "3540643591",
    volume = "1388",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "384--386",
    booktitle = "Parallel and Distributed Processing - 10 IPPS/SPDP 1998 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Proceedings",

    }

    TY - GEN

    T1 - On randomized and deterministic schemes for routing and sorting on fixed-connection networks

    AU - Suel, Torsten

    PY - 1998

    Y1 - 1998

    N2 - We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on fixedconnection networks such as meshes, hypercubes or point-to-point networks. On the randomized side, we focus on the techniques of randomized routing and random sampling and their use in many algorithms, while our presentation of deterministic algorithms uses the example of the Columnsort algorithm to highlight techniques such as local sorting and deterministic sampling. We then demonstrate that there is a close relationship between the randomized and deterministic techniques presented, and illustrate how this relationship can be used to transform randomized into deterministic algorithms and vice versa. Our main objective here is to provide a more unified perspective on many of the algorithms in the literature, and we do not attempt to provide a complete survey of routing and sorting problems on parallel machines.

    AB - We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on fixedconnection networks such as meshes, hypercubes or point-to-point networks. On the randomized side, we focus on the techniques of randomized routing and random sampling and their use in many algorithms, while our presentation of deterministic algorithms uses the example of the Columnsort algorithm to highlight techniques such as local sorting and deterministic sampling. We then demonstrate that there is a close relationship between the randomized and deterministic techniques presented, and illustrate how this relationship can be used to transform randomized into deterministic algorithms and vice versa. Our main objective here is to provide a more unified perspective on many of the algorithms in the literature, and we do not attempt to provide a complete survey of routing and sorting problems on parallel machines.

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

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

    M3 - Conference contribution

    SN - 3540643591

    SN - 9783540643593

    VL - 1388

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 384

    EP - 386

    BT - Parallel and Distributed Processing - 10 IPPS/SPDP 1998 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Proceedings

    PB - Springer Verlag

    ER -