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.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Analysis of routing in pyramid architectures


    Contributors:
    Mzaik, T. (author) / Chandra, S. (author) / Panda, D.K. (author) / Jagadeesh, J.M. (author)


    Publication date :

    1993-01-01


    Size :

    628472 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    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