Subscribe

Issue No.09 - September (2010 vol.21)

pp: 1342-1353

Lev Levitin , Boston University, Boston

Mark Karpovsky , Boston University, Boston

Mehmet Mustafa , Boston University, Boston

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.174

ABSTRACT

The problem of preventing deadlocks and livelocks in computer communication networks, in particular, those with wormhole routing, is considered. The method to prevent deadlocks is to prohibit certain turns (i.e., the use of certain pairs of connected edges) in the routing process, in such a way that eliminates all cycles in the graph. We propose a new algorithm that constructs a minimal (irreducible) set of turns that breaks all cycles and preserves connectivity of the graph. The algorithm is tree-free and is considerably simpler than earlier cycle-breaking algorithms. We prove its properties and present lower and upper bounds for minimum cardinalities of cycle-breaking connectivity preserving sets for graphs of general topology as well as for planar graphs. In particular, the algorithm guarantees that not more than 1/3 of all turns in the network become prohibited. We also present experimental results on the fraction of prohibited turns, the distance dilation, as well as on the message delivery times and saturation loads for the proposed algorithm in comparison with known tree-based algorithms. The proposed algorithm outperforms substantially the tree-based algorithms in all characteristics considered.

INDEX TERMS

Routing algorithms, deadlocks, livelocks, turn prohibition, wormhole routing.

CITATION

Lev Levitin, Mark Karpovsky, Mehmet Mustafa, "Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks",

*IEEE Transactions on Parallel & Distributed Systems*, vol.21, no. 9, pp. 1342-1353, September 2010, doi:10.1109/TPDS.2009.174REFERENCES

- [1] C.L. Seitz, "The Hypercube Communication Chip," Display File 5182:DF:85, California Inst. of Tech nology, Mar. 1985.
- [2] E. Fleury and P. Fraigniaud, "A General Theory for Deadlock Avoidance in Wormhole-Routed Networks,"
IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 7, pp. 626-638, July 1998.- [3] R. Libeskind-Hadas, D. Mazzoni, and R. Rajagopalan, "Tree-Based Multicasting in Wormhole-Routed Irregular Topologies,"
Proc. Merged 12th Int'l Parallel Processing Symp. and the Ninth Symp. Parallel and Distributed Processing, pp. 244-249, 1998.- [4] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Directed Networks,"
Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.- [5] L. Zakrevski, S. Jaiswal, L. Levitin, and M. Karpovsky, "A New Method for Deadlock Elimination in Computer Networks with Irregular Toplologies,"
Proc. Int'l Assoc. of Science and Technology for Development (IASTED) Conf., Parallel and Distributed Computing Systems (PDCS '99), vol. 1, pp. 396-402, 1999.- [6] J. Duato, "A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks,"
IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1320-1331, Dec. 1993.- [7] 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. 1055-1067, Oct. 1995.- [8] L. Schwiebert and D.N. Jayasimha, "A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing,"
J. Parallel and Distributed Computing, vol. 32, no. 1, pp. 103-117, 1996.- [9] L. Schwiebert, "Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies,"
IEEE Trans. Computers, vol. 50, no. 9, pp. 865-876, Sept. 2001.- [10] D.N. Jayasimha, L. Schwiebert, D. Manivannan, and J.A. May, "A Foundation for Designing Deadlock-Free Routing Algorithms in Wormhole Networks,"
J. ACM, vol. 50, no. 2, pp. 250-275, 2003.- [11] M.D. Schroeder, A.D. Birrell, M. Burrows, H. Murray, R.M. Needham, T.L. Rodeheffer, E.H. Satterthwaite, and C.P. Thacker, "Autonet: A High-Speed Self Configuring Local Area Network Using Point-to-Point Links," SRC Technical Report SRC Research Report 59, Digital Equipment Corporation, Apr. 1990.
- [12] C. Glass and L. Ni, "The Turn Model for Adaptive Routing,"
J. ACM, vol. 5, pp. 874-902, 1994.- [13] D. Starobinski, M. Karpovsky, and L. Zakrevski, "Application of Network Calculus to General Topologies Using Turn Prohibition,"
IEEE/ACM Trans. Networking, vol. 11, no. 3, pp. 411-421, June 2003.- [14] G. Einhoff and M. Fidler, "The Turnnet Concept: Routing in Feed-Forward Networks with Prohibited Turns,"
Proc. IEEE Int'l Conf. Comm., vol. 4, pp. 2009-2013, June 2004.- [15] R. Horst, "ServerNet(TM) Deadlock Avoidance and Fractahedral Topologies,"
Proc. IEEE Int'l Parallel Processing Symp., pp. 274-280, 1996.- [16] L. Zakrevski and M.G. Karpovsky, "Fault-Tolerant Message Routing in Computer Networks,"
Proc. Int'l Conf. Parallel and Distributed Processing and Applications (PDPA '99), pp. 2279-2287, 1999.- [17] M. Mustafa, M. Karpovsky, and L. Levitin, "Cycle Breaking in Wormhole Routed Computer Communication Networks,"
Proc. Conf. Opnetwork '05, Aug. 2005.- [18] L.B. Levitin, M.G. Karpovsky, M. Mustafa, and L. Zakrevski, "New Algorithm for Finding Cycle-Breaking Sets of Turns in a Graph,"
J. Graph Algorithms and Applications (JGAA), vol. 10, pp. 387-420, 2006.- [19] M. Koibuchi, A. Funahashi, A. Jouraku, and H. Amano, "L-Turn Routing: An Adaptive Routing in Irregular Networks,"
Proc. IEEE Int'l Conf. Parallel Processing, pp. 383-392, Sept. 2001.- [20] J. Sancho and A. Robles, "Improving the ${\rm Up}^{\ast}/{\rm Down}^{\ast}$ Routing Scheme for Networks of Workstations,"
Proc. Conf. Euro-Par 2000, Aug. 2000.- [21] J. Sancho, A. Robles, and J. Duato, "A Flexible Routing Scheme for Networks of Workstations,"
Proc. Int'l Symp. High-Performance Computing (ISHPC), pp. 260-267, 2000.- [22] Y.-M. Sun, C.-H. Yang, Y.-C. Chung, and T.-Y. Huang, "An Efficient Deadlock-Free Tree-Based Routing Algorithm for Irregular Wormhole-Routed Networks Based on the Turn Model,"
Proc. Int'l Conf. Parallel Processing (ICPP '04), pp. 343-352, 2004.- [23] J.C. Sancho, A. Robles, and J. Duato, "An Effective Methodology to Improve the Performance of the ${\rm Up}^{\ast}/{\rm Down}^{\ast}$ Routing Algorithm,"
IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 8, pp. 740-754, Aug. 2004.- [24] J. Zhou, X.-Y. Lin, and Y.-C. Chung, "A Tree-Turn Model for Irregular Networks,"
Proc. Fifth IEEE Int'l Symp. Network Computing and Applications (NCA '06), pp. 11-18, 2006.- [25] A. Jouraku, M. Koibuchi, and H. Amano, "An Effective Design of Deadlock-Free Routing Algorithms Based on 2d Turn Model for Irregular Networks,"
IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 3, pp. 320-333, Mar. 2007.- [26] N.J. Boden, D. Cohen, R.E. Felderman, C.L. Seitz, J.N. Seizovic, and W.-K. Su, "Myrinet: A Gigabit Per Second Local Area Network,"
IEEE Micro, vol. 15, no. 1, pp. 29-36, Feb. 1995.- [27] "InfiniBand Architecture Specification Release 1.2.1," http:/www.infinibandta.org, Jan. 2008.
- [28] A. Mejia, J. Flitch, J. Duato, S.A. Reinemo, and T. Skeie, "Segment-Based Routing: An Efficient Fault-Tolerant Routing Algorithm for Meshes and Tori,"
Proc. 20th Int'l Parallel and Distributed Processing Symp. (IPDPS '06), 2006.- [29] M. Mustafa, M. Karpovsky, and L. Levitin, "Cycle Breaking in Wormhole Routed Computer Communication Networks,"
Proc. Conf. Opnetwork '05, Aug. 2005.- [30] T.H. Cormen, C.E. Leiserson, and R.L. Rivest,
Introduction to Algorithms. The MIT Press, 1989.- [31] G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi,
Complexity and Approximation. Springer-Verlag, 2003.- [32] L. Zakrevski, "Fault-Tolerant Wormhole Message Routing in Computer Communication Networks," PhD dissertation, College of Electrical Eng., Boston Univ., 2000.
- [33] L. Zakrevski, S. Jaiswal, and M. Karpovsky, "Unicast Message Routing in Communication Networks with Irregular Topologies,"
Proc. Conf. Computer Aided Design (CAD), 1999.- [34] L. Levitin, M. Mustafa, and M. Karpovsky, "A Polynomial-Time Approximation Algorithm for the Turn Prohibition Problem in Regular Graphs," to be published.
- [35] A. Agarwal, M. Mustafa, and A.S. Pandya, "QOS Driven Network-on-Chip Design for Real Time Systems,"
Proc. IEEE Canadian Conf. Electrical and Computer Eng. (CCECE '06), pp. 1291-1295, May 2006.- [36] A. Agarwal, M. Mustafa, R. Shankar, A.S. Pandya, and Y. Lho, "A Deadlock Free Router Design for Network on Chip Architecture,"
J. Korea Inst. of Maritime Information and Comm. Sciences, vol. 11, no. 4, pp. 696-706, Apr. 2007.- [37] B. Parhami,
Introduction to Parallel Processing: Algorithms and Architectures. Plenum Press, 1998.- [38] M. Mustafa, L. Levitin, and M. Karpovsky, "Weighted Turn Prohibition in Computer Communication Networks,"
Proc. Conf. Opnetwork '06, Aug. 2006. |