Title :
Randomized routing with shorter paths
Author :
Upfal, Eli ; Felperin, Sergio ; Snir, Marc
Author_Institution :
IBM Almaden Res. Center, San Jose, CA, USA
fDate :
4/1/1996 12:00:00 AM
Abstract :
Studies the use of randomized routing in multistage networks. While log N additional randomizing stages are needed to break “spatial locality”, within each permutation, only log log N additional randomizing stages are needed to break “temporal locality” among successive permutations. Thus, log N bits of initial randomization per input, followed by log log N bits of randomization per packet are sufficient to ensure that t permutations are delivered in time t+log N. We present simulation results that validate this analysis
Keywords :
multistage interconnection networks; network routing; butterfly networks; interconnection networks; multistage networks; packet-switching; parallel communication; randomized routing; shorter paths; Analytical models; Circuit simulation; Communication switching; Context; Delay; Intelligent networks; Packet switching; Routing; Switches; Switching circuits;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
