DocumentCode
900581
Title
Randomized routing with shorter paths
Author
Upfal, Eli ; Felperin, Sergio ; Snir, Marc
Author_Institution
IBM Almaden Res. Center, San Jose, CA, USA
Volume
7
Issue
4
fYear
1996
fDate
4/1/1996 12:00:00 AM
Firstpage
356
Lastpage
362
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;
fLanguage
English
Journal_Title
Parallel and Distributed Systems, IEEE Transactions on
Publisher
ieee
ISSN
1045-9219
Type
jour
DOI
10.1109/71.494630
Filename
494630
Link To Document