论文信息 - Bounds on evacuation time for deflection routing

Bounds on evacuation time for deflection routing

SummaryUpper bounds are given on the timeT needed to evacuatek packets from a synchronous packet network using deflection routing, whereby all packets that arrive at a node during one time slot leave the node during the next slot. For example,T≤n+2(k−1) for a binaryn-cube network when priority is given to packets closer to their destination, and for a single destination networkT is less than or equal to the network diameter plusk−1 times the network deflection index. Deflection routing for one pass through an omega network is also considered.

Bruce E. Hajek | B. Hajek

[1] P. Baran,et al. On Distributed Communications Networks , 1964 .

[2] Paul Baran,et al. On Distributed Communications: I. Introduction to Distributed Communications Networks , 1964 .

[3] Duncan H. Lawrie,et al. Accessand Alignment ofDatainan Array Processor , 1975 .

[4] Burton J. Smith. Architecture And Applications Of The HEP Multiprocessor Computer System , 1982, Optics & Photonics.

[5] Chuan-Lin Wu,et al. Interconnection Networks for Parallel and Distributed Processing , 1984 .

[6] Allan Borodin,et al. Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..

[7] W. Daniel Hillis,et al. The connection machine , 1985 .

[8] A G Greenberg,et al. Sharp approximation models of adaptive routing in mesh networks (preliminary report) , 1986 .

[9] Charles L. Seitz,et al. A framework for adaptive routing in multicomputer networks , 1989, CARN.