This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Periodically Regular Chordal Rings
June 1999 (vol. 10 no. 6)
pp. 658-672

Abstract—Chordal rings have been proposed in the past as networks that combine the simple routing framework of rings with the lower diameter, wider bisection, and higher resilience of other architectures. Virtually all proposed chordal ring networks are node-symmetric, i.e., all nodes have the same in/out degree and interconnection pattern. Unfortunately, such regular chordal rings are not scalable. In this paper, periodically regular chordal (PRC) ring networks are proposed as a compromise for combining low node degree with small diameter. By varying the PRC ring parameters, one can obtain architectures with significantly different characteristics (e.g., from linear to logarithmic diameter), while maintaining an elegant framework for computation and communication. In particular, a very simple and efficient routing algorithm works for the entire spectrum of PRC rings thus obtained. This flexibility has important implications for key system attributes such as architectural scalability, software portability, and fault tolerance. Our discussion is centered on unidirectional PRC rings with in/out-degree of 2. We explore the basic structure, topological properties, optimization of parameters, VLSI layout, and scalability of such networks, develop packet and wormhole routing algorithms for them, and briefly compare them to competing fixed-degree architectures such as symmetric chordal rings, meshes, tori, and cube-connected cycles.

[1] D.P. Agrawal, C. Chen, and J.R. Burke, “A Comparison of Hybrid Graph Based Topologies,” IEEE Computer Architecture Technical Committee Newsletter, pp. 5-8, Winter 1994-1995.
[2] B.W. Arden and H. Lee, “Analysis of Chordal Ring Networks,” IEEE Trans. Computers, vol. 30, no. 4, pp. 291-295, Apr. 1981.
[3] B.W. Arden and K.-T. Tang, “Routing for Generalized Chordal Rings,” Proc. ACM 18th Computer Science Conf., pp. 271-275, Feb. 1990.
[4] P. Banerjee,“The cubical ring connected cycles: A fault-tolerant parallel computationnetwork,” IEEE Trans. Computers, vol. 37, no. 5, pp. 632-636, May 1988.
[5] J.-C. Bermond, F. Comellas, and D.F. Hsu, “Distributed Loop Computers: A Survey,” J. Parallel and Distributed Computing, vol. 24, pp. 2-10, 1995.
[6] G. Bilardi and F.P. Preparata, "Horizons of Parallel Computation," J. Parallel and Distributed Computing, vol. 27, pp. 172-182, 1996.
[7] T.Y. Chung, N. Sharma, and D.P. Agrawal, “Cost-Performance Tradeoffs in Manhattan Street Networks Versus 2-D Torus,” IEEE Trans. Computers, vol. 43, no. 2, pp. 240-243, Feb. 1994.
[8] W.J. Dally, "Virtual-Channel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
[9] W.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[10] K.W. Doty, “New Designs for Dense Processor Interconnection Networks,” IEEE Trans. Computers, vol. 33, no. 5, pp. 447-450, May 1984.
[11] J. Duato, “A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 10, pp. 1,055–1,067, Oct. 1995.
[12] L.M. Huisman and S. Kundu, “Highly Reliable Symmetric Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 94-97, Jan. 1994.
[13] F.K. Hwang, “Comments on Reliable Loop Topologies for Large Local Computer Networks,” IEEE Trans. Computers, vol. 36, no. 3, pp. 383-384, Mar. 1987.
[14] Kendall Square Research, “KSR1 Technology Background,” 1992.
[15] D.-M. Kwai and B. Parhami, “Periodically Regular Chordal Rings as Fault-Tolerant Loops,” Proc. Pacific Rim Int'l Symp. Fault-Tolerant Systems, pp. 210-215, Dec. 1995.
[16] D.-M. Kwai and B. Parhami, “Comparing the Performance Parameters of Two Network Structures for Scalable Massively Parallel Processors,” Proc. Int'l Workshop Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, pp. 273-277, Feb. 1996.
[17] D.-M. Kwai and B. Parhami, “Periodically Regular Chordal Rings: Generality, Scalability, and VLSI Layout,” Proc. Eighth IEEE Symp. Parallel and Distributed Processing, pp. 148-151, 1996.
[18] S. Latifi, M.M. Azevedo, and N. Bagherzadeh, “The Star Connected Cycles: A Fixed-Degree Network for Parallel Processing,” Proc. Int'l Conf. Parallel Processing, vol. I, pp. 91-95, 1993.
[19] I.Y. Lee and S.-D. Wang, “Ring-Connected Networks and Their Relationship to Cubical Ring Connected Cycles and Dynamic Redundancy Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 9, pp. 988-996, Sept. 1995.
[20] N.F. Maxemchuk, "Routing in the Manhattan Street Network," IEEE Trans. Comm., vol. 35, no. 5, pp. 503-512, May 1987.
[21] D.S. Meliksetian and C.Y.R. Chen, “Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 10, pp. 1,172-1,178, Oct. 1993.
[22] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[23] 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-44, Winter 1994-1995.
[24] B. Parhami, “Periodically Regular Chordal Ring Networks for Massively Parallel Architectures,” Proc. Fifth Symp. Frontiers Massively Parallel Computation, pp. 315-322, Feb. 1995.
[25] B. Parhami, Introduction to Parallel Processing. Plenum, 1999.
[26] B. Parhami and D.-M. Kwai, “A Characterization of Symmetric Chordal Rings Using Redundant Number Representations,” Proc. Int'l Conf. Systems Eng., pp. 467-472, July 1996.
[27] B. Parhami and D.-M. Kwai, “Wormhole Routing on a Class of High-Performance Fixed-Degree Parallel Processor Networks,” Proc. 11th Int'l Conf. Parallel and Distributed Computing and Systems, pp. 376-378, Oct. 1998.
[28] F.P. Preparata and J. Vuillemin, “The Cube-Connected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300-309, 1981.
[29] C.S. Raghavendra, M. Gerla, and A. Avizienis, “Reliable Loop Topologies for Large Local Computer Networks,” IEEE Trans. Computers, vol. 34, no. 1, pp. 46-55, Jan. 1985.
[30] M. Valerio, L.E. Moser, P.M. Melliar-Smith, and P. Sweazey, “The QuickRing Network,” Proc. ACM 22nd Computer Science Conf., pp. 233-240, Mar. 1994.
[31] J. van Leeuwen and R.B. Tan, “Interval Routing,” The Computer J., vol. 30, no. 4, pp. 298-307, Aug. 1987.
[32] P.M.B. Vitányi, "Locality, Communication, and Interconnect Length in Multicomputers," SIAM J. Computing, vol. 17, no. 4, pp. 659-672, Aug. 1988.
[33] C.K. Wong and D. Coppersmith, “A Combinatorial Problem Related to Multimodule Organizations,” J. ACM, vol. 21, pp. 392-402, July 1974.
[34] C.-H. Yeh and B. Parhami, “Cyclic Petersen Networks—Efficient Fixed-Degree Interconnection Networks for Large-Scale Multicomputer Systems,” Proc. Int'l Conf. Parallel and Distributed Processing: Techniques and Applications, pp. 549-560, Aug. 1996.
[35] G.W. Zimmerman and A.H. Esfahanian, “Chordal Rings as Fault-Tolerant Loops,” Discrete Applied Math., vol. 37/38, pp. 563-573, July 1992.

Index Terms:
Chordal rings, fault tolerance, greedy routing, hierarchical parallel architectures, interconnection networks, routing algorithms, skip links.
Citation:
Behrooz Parhami, Ding-Ming Kwai, "Periodically Regular Chordal Rings," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 6, pp. 658-672, June 1999, doi:10.1109/71.774913
Usage of this product signifies your acceptance of the Terms of Use.