This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Evil Twin Networks and the Value of Limited Randomized Routing
September 2000 (vol. 11 no. 9)
pp. 910-925
ASCII Text
x 
 
Brian D. Alleyne, Isaac D. Scherson, "On Evil Twin Networks and the Value of Limited Randomized Routing," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 9, pp. 910-925, September, 2000.
 
 
BibTex
x
 
@article{ 10.1109/71.879774,
author = {Brian D. Alleyne and Isaac D. Scherson},
title = {On Evil Twin Networks and the Value of Limited Randomized Routing},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {11},
number = {9},
issn = {1045-9219},
year = {2000},
pages = {910-925},
doi = {http://doi.ieeecomputersociety.org/10.1109/71.879774},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - On Evil Twin Networks and the Value of Limited Randomized Routing
IS - 9
SN - 1045-9219
SP910
EP925
EPD - 910-925
A1 - Brian D. Alleyne,
A1 - Isaac D. Scherson,
PY - 2000
KW - Multistage interconnection networks (MINs)
KW - permutation routing
KW - Clos networks
KW - Delta networks
KW - randomized routing
KW - recirculating networks
KW - SIMD computers.
VL - 11
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 

Abstract—A dynamic two-stage Delta network ($N$ inputs and outputs) is introduced and analyzed for permutation routing. The notion of evil twins is introduced and a deterministic procedure is given to route any permutation in no more than $2 \root 4 \of N$ network cycles. Two limited randomized routing schemes are then analyzed. The first called Single Randomization yields on average at most $N {\bar !}+1+{\frac{1}{N}}$ ($N {\bar !} =O({\frac{\log{N}}{\log\log{N}}})$1 and is the greatest integer such that $(N {\bar !} )! \leq N$) network cycles and the second called Multiple Randomization yields on average at most $\lfloor \log(\log{N}+1)\rfloor+2+{\frac{1}{N}}$ network cycles for any input permutation. The probability of any permutation requiring at least $c$ network cycles more than the above average bounds is then shown to be at most ${\frac{1}{(c+1)!}}$ for Single Randomization and ${\frac{1}{N^{2^{c}}}}$ for Multiple Randomization, respectively. It is then shown how the dynamic two-stage network can be physically realized as a three-stage network. Both the evil twin and Multiple Randomization algorithms have been integrated into an off-the-shelf ASIC from PMC-Sierra, Inc. (PM-73488) which has been designed as a building block for such a three-stage implementation. These routing schemes are also adapted to run on a recirculating network. Recirculation is used to effect a reshuffling of data as in the dynamic network, but with a considerable reduction in network cost.

[1] B.D. Alleyne and C.K. Chien., “Theory Really Works in Practice (an ATM Chipset Case Study),” Proc. Digital Comm. Design Conf., (DesignCon '98), Jan. 1998.
[2] G. Almasi and A. Gottlieb, Highly Parallel Computing, chap. 4. Benjamin/Cummings, 1989.
[3] G.B. Adams and H.J. Siegel, “The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems,” IEEE Trans. Computers, vol. 31, no. 5, pp. 443–454, May 1982.
[4] B.D. Alleyne and I.D. Scherson, “Permutation Routing in Two-Stage Recirculating Delta Networks,” Frontiers of Massively Parallel Processing, pp. 502–503, Oct. 1992.
[5] B.D. Alleyne and I.D. Scherson, “On Evil Twin Networks and the Value of Limited Randomized Routing,” Proc. Int'l Parallel Processing Symp., pp. 566–575, Apr. 1994.
[6] L.N. Bhuyan and D.P. Agrawal, “Design and Performance of Generalized Interconnection Networks,” IEEE Trans. Computers, vol. 32, no. 12, pp. 1,081–1,090, Dec. 1983.
[7] K.E. Batcher, “Design of a Massively Parallel Processor, IEEE Trans. Computers, vol. 29, no. 9, pp. 836–840, Sept. 1980.
[8] V.E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic Press, 1965.
[9] T. Blank, "The MasPar MP-1 Architecture," IEEE Compcon, pp. 20-24. IEEE, San Francisco, Feb./Mar. 1990.
[10] M. Bhatia and A. Youssef, “Efficient Randomized Fault-Tolerant Routing on Clos Networks,” Proc. 1992 IEEE Workshop Fault-Tolerant Parallel and Distributed Systems, pp. 217–224, July 1992.
[11] R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa, K. Schroder, R.K. Sitaraman, and B. Vocking, “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks,” Proc. Symp. Theory of Computing, pp. 378–388, May 1998.
[12] T.Y. Feng, “A Survey of Interconnection Networks,” Computer, vol. 14, no. 12, pp. 12–27, Dec. 1981.
[13] T.Y. Feng and W. Young, “An$O(\log^2{N})$Control Algorithm,” Proc. Int'l Conf. Parallel Processing, pp. 334–340, Aug. 1985.
[14] W.D. Hillis, The Connection Machine.Cambridge, Mass.: The MIT Press, 1985.
[15] R. Koch, “Increasing the Size of a Network by a Constant Factor Can Increase Performance by More than a Constant Factor,” Symp. Foundations of Computer Science, pp. 221–230, Oct. 1988.
[16] C.P. Kruskal and M. Snir, “The Performance of Multistage Interconnection Networks for Multiprocessors,” IEEE Trans. Computers, vol. 32, no. 12, pp. 1,091–1,098, Dec. 1983.
[17] D.H. Lawrie, “Access and Alignment of Data in an Array Processor,” IEEE Trans. Computers, vol. 24, no. 12, pp. 1,145–1,155, Dec. 1975.
[18] K.Y. Lee, "A New Benes Network Control Algorithm," IEEE Trans. Computers, vol. 36, no. 6, pp. 768-772, June 1987.
[19] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[20] J. Lenfant, “Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations,” IEEE Trans. Computers, vol. 27, no. 7, pp. 637–647, July 1978.
[21] G.F. Lev, N. Pippenger, and L.G. Valiant, “A Fast Parallel Algorithm for Routing in Permutation Networks,” IEEE Trans. Computers, vol. 30, no. 2, pp. 93–100, Feb. 1981.
[22] B.M. Maggs and R.K. Sitaraman, “Simple Algorithms for Routing on Butterfly Networks with Bounded Queues,” Symp. Theory of Computing, pp. 150–161, May 1992.
[23] D. Nassimi and S. Sahni, “A Self-Routing Benes Network and Parallel Permutation Algorithms,” IEEE Trans. Computers, vol. 30, no. 5 pp. 332–340, May 1981.
[24] J.H. Patel, “Performance of Processor-Memory Interconnections for Multiprocessors,” IEEE Trans. Computers, vol. 29, no. 10, pp. 771–780, Oct. 1981.
[25] PMC-Sierra, Inc., “PM73488 QSE 5 Gbit/s ATM Switch Fabric Element Datasheet,” Oct. 1998.
[26] A.G. Ranade, “Constrained Randomization for Parallel Communication,” Technical Report YALEU/DCS/TR-511, Dept. Computer Science, Yale Univ., New Haven, Conn., 1987.
[27] C.S. Raghavendra and R.V. Boppana,"On self-routing in Benes and shuffle-exchange networks," IEEE Trans. Computers, vol. 40, no. 9, pp.1057-1064, Sept. 1991.
[28] M. Snir, S. Feleprin, and E. Upfal, “Randomized Routing with Shorter Paths,” Proc. Fifth IEEE Symp. Parallel and Distributed Processing, pp. 283–292, 1993.
[29] T.H. Szymansky and V.C. Hamacher,“On the permutation capability of multistage interconnection networks,” IEEE Trans. Computers, vol. 36, pp. 810-822, 1987.
[30] H.J. Siegel, Interconnection Networks for Large-Scale Parallel Processing, Second Ed., McGraw-Hill, New York, 1990.
[31] L.G. Valiant, “A Scheme for Fast Parallel Communication,” SIAM J. Computers, vol. 11, no. 2, pp. 350–361, May 1982.
[32] A. Youssef and B. Arden, “A New Approach to Fast Control of$r^2 \times r^2$Three-Stage Benes Networks of$r\times r$Crossbar Switches,” Proc. 17th Ann. Symp. Computer Architecture, pp. 50–59, May 1990.
[33] A. Youssef, “Randomized Self-Routing Algorithms for Clos Networks,” Computers and Electrical Eng., vol.19, no. 6, pp. 419-429, 1993.

Index Terms:
Multistage interconnection networks (MINs), permutation routing, Clos networks, Delta networks, randomized routing, recirculating networks, SIMD computers.
Citation:
Brian D. Alleyne, Isaac D. Scherson, "On Evil Twin Networks and the Value of Limited Randomized Routing," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 9, pp. 910-925, Sept. 2000, doi:10.1109/71.879774
Usage of this product signifies your acceptance of the Terms of Use.