Analysis of routing in pyramid architectures

Abstract

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