This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Flexible Bit-Pattern Associative Router for Interconnection Networks
May 1996 (vol. 7 no. 5)
pp. 477-485

Abstract—A programmable associative approach to execute implicit routing algorithms is presented. Algorithms are mapped onto a set of bit-patterns that are matched in parallel. We have studied and mapped a large number of routing algorithms for a wide range of interconnection network topologies. Here we report three cases that illustrate the capabilities of the router scheme. For the studied topologies, the number of required bit-patterns is of the same order as the topology degree. The proposed approach is one of the fastest routers and requires a very small amount of hardware.

[1] A.A. Chien, "A Cost and Speed Model for k-ary n-cube Wormhole Routers," Proc. Hot Interconnects '93,Palo Alto, Calif., Aug.5-7, 1993.
[2] U. De Carlini and U. Villano, Transputers and Parallel Architectures: Message Passing Distributed Systems.New York: Ellis Horwood, 1991.
[3] J.G. Delgado-Frias, R. Sze, D. Summerville, and V. Aikens, "A VLSI CAM-Based Router for Multiprocessor Organizations," Proc. Fourth Great Lakes Symp. VLSI,Notre Dame, Ind., pp. 124-129, Mar. 1994.
[4] A.H. Esfahanian, L.M. Ni, and B.E. Sagan, "The Twisted n-Cube with Application to Multiprocessing," IEEE Trans. Computers, vol. 40, no. 1, pp. 88-93, Jan. 1991.
[5] C.J. Glass and L.M. Ni, “The Turn Model for Adaptive Routing,” J. ACM, vol. 41, no. 5, pp. 874-902, Sept. 1994.
[6] E. Horowitz and A. Zorat, "The Binary Tree as Interconnection Network: Applications to Multiprocessor Systems and VLSI," IEEE Trans. on Computers, vol. 30, no. 4, pp. 247-253, Apr. 1981.
[7] INMOS Ltd., The 9000 Transputer Products Overview Manual. INMOS document number: 72 TRN 228 00, 1991.
[8] F.T. Leighton,"Average Case Analysis of Greedy Routing Algorithms on Arrays," Proc. Second Ann. ACM Symp. Parallel Algorithms and Architectures, SPAA '90, Crete, July2-6, 1990.
[9] W.G.P. Mooij and A. Ligtenberg, "Architecture of a Communication Network Processor," PARLE '89: Parallel Architectures and Languages Europe, E. Odijk, M. Rem, and J.-C. Syre, eds., Lecture Notes in Computer Science 365. Berlin: Springer-Verlag, 1989.
[10] L.M. Ni and D.K. Panda, "A Report of the ICPP '94 Panel on Sea of Interconnection Networks: What's Your Choice?" IEEE Computer Architecture Technical Committee Newsletter, pp. 31-34, Winter 1994-1995.
[11] J. Park, S. Vassiliadis, and J.G. Delgado-Frias, "Flexible Oblivious Router Architecture," IBM Technical Report TR01.C749, IBM, Endicott, N.Y. 13760, Sept. 1993. Also in IBM J. of Research and Development, vol. 39, no. 3, pp. 315-329, May 1995.
[12] C. L. Seitz,“The cosmic cube,”CACM, vol. 28, pp. 22–33, Jan. 1985.
[13] D. Smitley, F. Hady, and D. Burns, "Hnet: A High-Performance Network Evaluation Testbed," Proc. 1992 Int'l Conf. Parallel Processing, vol. 1, pp. 276-279, Aug. 1992.
[14] R. Allen, D. Garlan, and J. Ivers, “Formal Modeling and Analysis of the HLA Component Integration Standard,” Proc. Sixth ACM SIGSOFT Symp. Foundations of Software Eng., pp. 70-79, Nov. 1998.
[15] D.H. Summerville, J.G. Delgado-Frias, and S. Vassiliadis, "A High Performance Flexible Router for Multiple Interconnection Networks," IBM Technical Report, IBM, Endicott, N.Y. 13790, July 1996.
[16] J. van Leeuwen and R.B. Tan, “Interval Routing,” The Computer J., vol. 30, no. 4, pp. 298-307, Aug. 1987.

Index Terms:
Routing algorithm execution, interconnection networks, associative memories, oblivious routing, adaptive routing, and flexible routers.
Citation:
Douglas H. Summerville, José G. Delgado-Frias, Stamatis Vassiliadis, "A Flexible Bit-Pattern Associative Router for Interconnection Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 5, pp. 477-485, May 1996, doi:10.1109/71.503772
Usage of this product signifies your acceptance of the Terms of Use.