Title :
Analysis of routing in pyramid architectures
Author :
Mzaik, Tahsin ; Chandra, Shalabh ; Panda, Dhableswar K. ; Jagadeesh, Jogikal M.
Author_Institution :
Ohio State Univ., Columbus, OH, USA
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
Keywords :
discrete event simulation; image processing; message passing; network routing; packet switching; parallel architectures; performance evaluation; average message latency; circuit switching; communication patterns; discrete event simulation library; flow control; image processing applications; massively parallel systems; maximum message latency; mesh connected nodes; neighbor-descedent-tree algorithm; neighbor-tree algorithm; node-to-node routing; packet switching; pyramid architectures; routing algorithms; simulation; wormhole routing; Communication system control; Communication system traffic control; DH-HEMTs; Delay; Image processing; Message passing; Packet switching; Pulse width modulation; Routing; Switching circuits;
Conference_Titel :
Aerospace and Electronics Conference, 1993. NAECON 1993., Proceedings of the IEEE 1993 National
Conference_Location :
Dayton, OH
Print_ISBN :
0-7803-1295-3
DOI :
10.1109/NAECON.1993.290835
