A layout for sparse cube-connected-cycles network

V. Leppänen, M. Penttonen, Martti Forsell

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

    3 Citations (Scopus)

    Abstract

    In the Network-On-Chip context, a number of computational units are connected to each other via a network. The computational units act as sources and sinks of messages that the units send to each other to implement some distributed computational functionality. When the units need to intensively send messages to each other, ordinary dense interconnection networks will not have enough bandwidth to transfer the messages at the same pace as those are produced by the computational units. We consider a sparse cube-connected-cycles network as a candidate for NOCs. Such a sparse network will have enough bandwidth to support high-throughput computing in the NOCs context. We show a grid-like layout for the sparse cube-connected-cycles network and give properties of such a layout. We compare the layout properties to previously reported properties of layouts for sparse mesh-based networks. Although the logical diameter of the sparse cube-connected-cycles network is favorable, its other properties are found to be rather poor
    Original languageEnglish
    Title of host publicationProceedings of the 12th International Conference on Computer Systems and Technologies, CompSysTech '11
    PublisherAssociation for Computing Machinery ACM
    Pages32-37
    ISBN (Print)978-1-4503-0917-2
    DOIs
    Publication statusPublished - 2011
    MoE publication typeA4 Article in a conference publication
    Event12th International Conference on Computer Systems and Technologies, CompSysTech'11 - Vienna, Austria
    Duration: 16 Jun 201117 Jun 2011

    Conference

    Conference12th International Conference on Computer Systems and Technologies, CompSysTech'11
    Abbreviated titleCompSysTech 2011
    CountryAustria
    CityVienna
    Period16/06/1117/06/11

    Fingerprint

    Bandwidth
    Throughput
    Network-on-chip

    Keywords

    • Cube-connected-cycles
    • layout
    • network on chip
    • sparse networks

    Cite this

    Leppänen, V., Penttonen, M., & Forsell, M. (2011). A layout for sparse cube-connected-cycles network. In Proceedings of the 12th International Conference on Computer Systems and Technologies, CompSysTech '11 (pp. 32-37). Association for Computing Machinery ACM. https://doi.org/10.1145/2023607.2023614
    Leppänen, V. ; Penttonen, M. ; Forsell, Martti. / A layout for sparse cube-connected-cycles network. Proceedings of the 12th International Conference on Computer Systems and Technologies, CompSysTech '11. Association for Computing Machinery ACM, 2011. pp. 32-37
    @inproceedings{42eb800195064e1ba93874683fc3b2af,
    title = "A layout for sparse cube-connected-cycles network",
    abstract = "In the Network-On-Chip context, a number of computational units are connected to each other via a network. The computational units act as sources and sinks of messages that the units send to each other to implement some distributed computational functionality. When the units need to intensively send messages to each other, ordinary dense interconnection networks will not have enough bandwidth to transfer the messages at the same pace as those are produced by the computational units. We consider a sparse cube-connected-cycles network as a candidate for NOCs. Such a sparse network will have enough bandwidth to support high-throughput computing in the NOCs context. We show a grid-like layout for the sparse cube-connected-cycles network and give properties of such a layout. We compare the layout properties to previously reported properties of layouts for sparse mesh-based networks. Although the logical diameter of the sparse cube-connected-cycles network is favorable, its other properties are found to be rather poor",
    keywords = "Cube-connected-cycles, layout, network on chip, sparse networks",
    author = "V. Lepp{\"a}nen and M. Penttonen and Martti Forsell",
    year = "2011",
    doi = "10.1145/2023607.2023614",
    language = "English",
    isbn = "978-1-4503-0917-2",
    pages = "32--37",
    booktitle = "Proceedings of the 12th International Conference on Computer Systems and Technologies, CompSysTech '11",
    publisher = "Association for Computing Machinery ACM",
    address = "United States",

    }

    Leppänen, V, Penttonen, M & Forsell, M 2011, A layout for sparse cube-connected-cycles network. in Proceedings of the 12th International Conference on Computer Systems and Technologies, CompSysTech '11. Association for Computing Machinery ACM, pp. 32-37, 12th International Conference on Computer Systems and Technologies, CompSysTech'11, Vienna, Austria, 16/06/11. https://doi.org/10.1145/2023607.2023614

    A layout for sparse cube-connected-cycles network. / Leppänen, V.; Penttonen, M.; Forsell, Martti.

    Proceedings of the 12th International Conference on Computer Systems and Technologies, CompSysTech '11. Association for Computing Machinery ACM, 2011. p. 32-37.

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

    TY - GEN

    T1 - A layout for sparse cube-connected-cycles network

    AU - Leppänen, V.

    AU - Penttonen, M.

    AU - Forsell, Martti

    PY - 2011

    Y1 - 2011

    N2 - In the Network-On-Chip context, a number of computational units are connected to each other via a network. The computational units act as sources and sinks of messages that the units send to each other to implement some distributed computational functionality. When the units need to intensively send messages to each other, ordinary dense interconnection networks will not have enough bandwidth to transfer the messages at the same pace as those are produced by the computational units. We consider a sparse cube-connected-cycles network as a candidate for NOCs. Such a sparse network will have enough bandwidth to support high-throughput computing in the NOCs context. We show a grid-like layout for the sparse cube-connected-cycles network and give properties of such a layout. We compare the layout properties to previously reported properties of layouts for sparse mesh-based networks. Although the logical diameter of the sparse cube-connected-cycles network is favorable, its other properties are found to be rather poor

    AB - In the Network-On-Chip context, a number of computational units are connected to each other via a network. The computational units act as sources and sinks of messages that the units send to each other to implement some distributed computational functionality. When the units need to intensively send messages to each other, ordinary dense interconnection networks will not have enough bandwidth to transfer the messages at the same pace as those are produced by the computational units. We consider a sparse cube-connected-cycles network as a candidate for NOCs. Such a sparse network will have enough bandwidth to support high-throughput computing in the NOCs context. We show a grid-like layout for the sparse cube-connected-cycles network and give properties of such a layout. We compare the layout properties to previously reported properties of layouts for sparse mesh-based networks. Although the logical diameter of the sparse cube-connected-cycles network is favorable, its other properties are found to be rather poor

    KW - Cube-connected-cycles

    KW - layout

    KW - network on chip

    KW - sparse networks

    U2 - 10.1145/2023607.2023614

    DO - 10.1145/2023607.2023614

    M3 - Conference article in proceedings

    SN - 978-1-4503-0917-2

    SP - 32

    EP - 37

    BT - Proceedings of the 12th International Conference on Computer Systems and Technologies, CompSysTech '11

    PB - Association for Computing Machinery ACM

    ER -

    Leppänen V, Penttonen M, Forsell M. A layout for sparse cube-connected-cycles network. In Proceedings of the 12th International Conference on Computer Systems and Technologies, CompSysTech '11. Association for Computing Machinery ACM. 2011. p. 32-37 https://doi.org/10.1145/2023607.2023614