Pyramid machines are massively parallel systems motivated by image processing applications. The architecture consists of several layers of mesh connected nodes of decreasing dimensions. In this paper, we investigate general node-to-node routing in pyramids. We propose two routing algorithms neighbor-tree (NT) and neighbor-descedent-tree (NDT). For each routing algorithm, we find the average and maximum message latency for each of the three flow control schemes: packet switching, circuit switching, and wormhole routing. The performance of the proposed algorithms is evaluated using a discrete event simulation library (SMPL) and is compared with pyramid mesh and tree routing.<>


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Analysis of routing in pyramid architectures


    Beteiligte:
    Mzaik, T. (Autor:in) / Chandra, S. (Autor:in) / Panda, D.K. (Autor:in) / Jagadeesh, J.M. (Autor:in)


    Erscheinungsdatum :

    01.01.1993


    Format / Umfang :

    628472 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Traffic Control Architectures with Re-Routing

    CHOW, Andy H. F. | TIBKAT | 2017


    PRODUCTIVITY PYRAMID

    Bloom, Eric P. | British Library Online Contents | 2016



    Internet Routing in Space: Architectures for Quality of Service

    Connary, Julie Ann / Donner, Paul / Johnson, Joe et al. | IEEE | 2009


    Road Network Pyramid Model

    Cai, X.H. / Bai, C.G. / Dou, W. | British Library Conference Proceedings | 2013