Routing and sorting on meshes with row and column buses

Torsten Suel

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

    Abstract

    We give improved deterministic algorithms for permutation routing and sorting on meshes with row and column buses. Among our results, we obtain a fairly simple algorithm for permutation routing on two-dimensional meshes with buses that achieves a running time of n + o(n) and a queue size of 2. We also describe an algorithm for routing on r-dimensional networks with a running time of (2-1/ r)n+o(n) and a queue size of 2, and show how to obtain deterministic algorithms for sorting whose running times match those for permutation routing. An interesting feature of our algorithms is that they can be implemented on a wide variety of different models of meshes with buses within the same bounds on time and queue size. finally, we also study the performance of meshes with buses on dynamic routing problems, and propose fast routing schemes under several different assumptions about the properties of the bus system.

    Original languageEnglish (US)
    Title of host publicationProceedings of the International Conference on Parallel Processing
    Place of PublicationPiscataway, NJ, United States
    PublisherPubl by IEEE
    Pages411-417
    Number of pages7
    ISBN (Print)0818656026
    StatePublished - 1994
    EventProceedings of the 8th International Parallel Processing Symposium - Cancun, Mex
    Duration: Apr 26 1994Apr 29 1994

    Other

    OtherProceedings of the 8th International Parallel Processing Symposium
    CityCancun, Mex
    Period4/26/944/29/94

    Fingerprint

    Sorting

    ASJC Scopus subject areas

    • Hardware and Architecture

    Cite this

    Suel, T. (1994). Routing and sorting on meshes with row and column buses. In Proceedings of the International Conference on Parallel Processing (pp. 411-417). Piscataway, NJ, United States: Publ by IEEE.

    Routing and sorting on meshes with row and column buses. / Suel, Torsten.

    Proceedings of the International Conference on Parallel Processing. Piscataway, NJ, United States : Publ by IEEE, 1994. p. 411-417.

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

    Suel, T 1994, Routing and sorting on meshes with row and column buses. in Proceedings of the International Conference on Parallel Processing. Publ by IEEE, Piscataway, NJ, United States, pp. 411-417, Proceedings of the 8th International Parallel Processing Symposium, Cancun, Mex, 4/26/94.
    Suel T. Routing and sorting on meshes with row and column buses. In Proceedings of the International Conference on Parallel Processing. Piscataway, NJ, United States: Publ by IEEE. 1994. p. 411-417
    Suel, Torsten. / Routing and sorting on meshes with row and column buses. Proceedings of the International Conference on Parallel Processing. Piscataway, NJ, United States : Publ by IEEE, 1994. pp. 411-417
    @inproceedings{b8811f31dcc94307a53d583369c90f79,
    title = "Routing and sorting on meshes with row and column buses",
    abstract = "We give improved deterministic algorithms for permutation routing and sorting on meshes with row and column buses. Among our results, we obtain a fairly simple algorithm for permutation routing on two-dimensional meshes with buses that achieves a running time of n + o(n) and a queue size of 2. We also describe an algorithm for routing on r-dimensional networks with a running time of (2-1/ r)n+o(n) and a queue size of 2, and show how to obtain deterministic algorithms for sorting whose running times match those for permutation routing. An interesting feature of our algorithms is that they can be implemented on a wide variety of different models of meshes with buses within the same bounds on time and queue size. finally, we also study the performance of meshes with buses on dynamic routing problems, and propose fast routing schemes under several different assumptions about the properties of the bus system.",
    author = "Torsten Suel",
    year = "1994",
    language = "English (US)",
    isbn = "0818656026",
    pages = "411--417",
    booktitle = "Proceedings of the International Conference on Parallel Processing",
    publisher = "Publ by IEEE",

    }

    TY - GEN

    T1 - Routing and sorting on meshes with row and column buses

    AU - Suel, Torsten

    PY - 1994

    Y1 - 1994

    N2 - We give improved deterministic algorithms for permutation routing and sorting on meshes with row and column buses. Among our results, we obtain a fairly simple algorithm for permutation routing on two-dimensional meshes with buses that achieves a running time of n + o(n) and a queue size of 2. We also describe an algorithm for routing on r-dimensional networks with a running time of (2-1/ r)n+o(n) and a queue size of 2, and show how to obtain deterministic algorithms for sorting whose running times match those for permutation routing. An interesting feature of our algorithms is that they can be implemented on a wide variety of different models of meshes with buses within the same bounds on time and queue size. finally, we also study the performance of meshes with buses on dynamic routing problems, and propose fast routing schemes under several different assumptions about the properties of the bus system.

    AB - We give improved deterministic algorithms for permutation routing and sorting on meshes with row and column buses. Among our results, we obtain a fairly simple algorithm for permutation routing on two-dimensional meshes with buses that achieves a running time of n + o(n) and a queue size of 2. We also describe an algorithm for routing on r-dimensional networks with a running time of (2-1/ r)n+o(n) and a queue size of 2, and show how to obtain deterministic algorithms for sorting whose running times match those for permutation routing. An interesting feature of our algorithms is that they can be implemented on a wide variety of different models of meshes with buses within the same bounds on time and queue size. finally, we also study the performance of meshes with buses on dynamic routing problems, and propose fast routing schemes under several different assumptions about the properties of the bus system.

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

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

    M3 - Conference contribution

    SN - 0818656026

    SP - 411

    EP - 417

    BT - Proceedings of the International Conference on Parallel Processing

    PB - Publ by IEEE

    CY - Piscataway, NJ, United States

    ER -