Subscribe

Issue No.07 - July (2012 vol.23)

pp: 1205-1215

Ra'ed Al-Dujaily , Newcastle University, Newcastle upon Tyne

Terrence Mak , Newcastle University, Newcastle upon Tyne

Fei Xia , Newcastle University, Newcastle upon Tyne

Alexandre (Alex) Yakovlev , Newcastle University, Newcastle upon Tyne

Maurizio Palesi , Kore University, Enna

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

ABSTRACT

Interconnection networks with adaptive routing are susceptible to deadlock, which could lead to performance degradation or system failure. Detecting deadlocks at runtime is challenging because of their highly distributed characteristics. In this paper, we present a deadlock detection method that utilizes runtime transitive closure (TC) computation to discover the existence of deadlock-equivalence sets, which imply loops of requests in networks-on-chip (NoCs). This detection scheme guarantees the discovery of all true deadlocks without false alarms in contrast with state-of-the-art approximation and heuristic approaches. A distributed TC-network architecture, which couples with the NoC infrastructure, is also presented to realize the detection mechanism efficiently. Detailed hardware realization architectures and schematics are also discussed. Our results based on a cycle-accurate simulator demonstrate the effectiveness of the proposed method. It drastically outperforms timing-based deadlock detection mechanisms by eliminating false detections and, thus, reducing energy wastage in retransmission for various traffic scenarios including real-world application. We found that timing-based methods may produce two orders of magnitude more deadlock alarms than the TC-network method. Moreover, the implementations presented in this paper demonstrate that the hardware overhead of TC-networks is insignificant.

INDEX TERMS

Networks-on-chip, deadlock detection, dynamic programming, transitive closure computation, performance analysis.

CITATION

Ra'ed Al-Dujaily, Terrence Mak, Fei Xia, Alexandre (Alex) Yakovlev, Maurizio Palesi, "Embedded Transitive Closure Network for Runtime Deadlock Detection in Networks-on-Chip",

*IEEE Transactions on Parallel & Distributed Systems*, vol.23, no. 7, pp. 1205-1215, July 2012, doi:10.1109/TPDS.2011.275REFERENCES

- [1] L. Benini and G. De Micheli, "Networks on Chips: A New SoC Paradigm,"
Computer, vol. 35, no. 1, pp. 70-78, Jan. 2002.- [2] S. Warnakulasuriya and T. Pinkston, "Characterization of Deadlocks in Interconnection Networks,"
Proc. 11th Int'l Symp. Parallel Processing (IPPS '97), pp. 80-86, 1997.- [3] J. Duato, S. Yalamanchili, and L.M. Ni,
Interconnection Networks: An Engineering Approach. Morgan Kaufmann Publishers, 2004.- [4] W.J. Dally and B. Towles,
Principles and Practices of Interconnection Networks. Morgan Kaufmann Publishers, 2004.- [5] J.G. Christopher and M.N. Lionel, "The Turn Model for Adaptive Routing,"
Proc. Ninth Parallel Processing Int'l Symp., vol. 41, no. 5, pp. 874-902, 1994.- [6] K. Anjan and T. Pinkston, "DISHA: A Deadlock Recovery Scheme for Fully Adaptive Routing,"
Proc. Ninth Int'l Parallel Processing Symp., pp. 537-543, 1995.- [7] G.-M. Chiu, "The Odd-Even Turn Model for Adaptive Routing,"
IEEE Trans. Parallel Distributed Systems, vol. 11, no. 7, pp. 729-738, July 2000.- [8] J.H. Kim, L. Ziqiang, and A.A. Chien, "Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing,"
IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 3, pp. 229-244, Mar. 1997.- [9] J.M. Martínez-Rubio, P. López, and J. Duato, "A Cost-Effective Approach to Deadlock Handling in Wormhole Networks,"
IEEE Trans. Parallel Distributed System, vol. 12, no. 7, pp. 716-729, July 2001.- [10] J.M. Martinez-Rubio, P. Lopez, and J. Duato, "FC3D: Flow Control Based Distributed Deadlock Detection Mechanism for True Fully Adaptive Routing in Wormhole Networks,"
IEEE Trans. Parallel Distributed System, vol. 14, no. 8, pp. 765-779, Aug. 2003.- [11] A. Lankes, T. Wild, A. Herkersdorf, S. Sonntag, and R. Reinig, "Comparison of Deadlock Recovery and Avoidance Mechanisms to Approach Message Dependent Deadlocks in On-Chip Networks,"
Proc. Fourth ACM/IEEE Int'l Symp. Networks-on-Chip (NOCS '10), pp. 17-24, 2010.- [12] K.V. Anjan, T.M. Pinkston, and J. Duato, "Generalized Theory for Deadlock-Free Adaptive Wormhole Routing and Its Application to Disha Concurrent,"
Proc. 10th Int'l Parallel Processing Symp., pp. 815-821, 1996.- [13] L. Soojung, "A Deadlock Detection Mechanism for True Fully Adaptive Routing in Regular Wormhole Networks,"
Computer Comm., vol. 30, no. 8, pp. 1826-1840, 2007.- [14] U.Y. Ogras and R. Marculescu, "'It's a Small World After All': NoC Performance Optimization via Long-Range Link Insertion"
IEEE Trans. Very Large Scale Integration Systems, vol. 14, no. 7, pp. 693-706, July 2006.- [15] R. Al-Dujaily, T. Mak, F. Xia, A. Yakovlev, and M. Palesi, "Run-Time Deadlock Detection in Networks-on-Chip Using Coupled Transitive Closure Networks,"
Proc. Design, Automation and Test in Europe Conf. and Exhibition (DATE), pp. 1-6, 2011.- [16] W. Dally and C. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,"
IEEE Trans. Computers, vol. C-36, no. 5, pp. 547-553, May 1987.- [17] 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.- [18] T.H. Cormen, C.E. Leiserson, and R.L. Rivest,
Introduction to Algorithms. MIT Press and McGraw-Hill, 2001.- [19] S. Kung, S. Lo, and P.S. Lewis, "Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems,"
IEEE Trans. Computers, vol. C-36, no. 5, pp. 603-614, May 1987.- [20] D. Sarkar and A. Mukherjee, "Design of Optimal Systolic Algorithms for the Transitive Closure Problem,"
IEEE Trans. Computers, vol. 41, no. 4, pp. 508-512, Apr. 1992.- [21] K. Lam and C. Tong, "Closed Semiring Connectionist Network for the Bellman-Ford Computation,"
Proc. IEE Computers and Digital Techniques, vol. 143, no. 3, pp. 189-195, May 1996.- [22] T. Mak, K. Lam, P.Y.K. Cheung, and W. Luk, "Adaptive Routing for Network-on-Chips Using a Dynamic Programming Network"
IEEE Trans. Industrial Electronics, vol. 58, no. 8, pp. 3701-3716, Aug. 2011.- [23] F. Fazzino, M. Palesi, and D. Patti, "Noxim: Network-on-Chip Simulator," http:/noxim.sourceforge.net, 2010.
- [24] G. Ascia, V. Catania, M. Palesi, and D. Patti, "Implementation and Analysis of a New Selection Strategy for Adaptive Routing in Networks-on-Chip,"
IEEE Trans. Computers, vol. 57, no. 6, pp. 809-820, June 2008.- [25] P.P. Pande, C. Grecu, and A. Ivanov, "High-Throughput Switch-Based Interconnect for Future SoCs,"
Proc. IEEE Int'l Workshop System-on-Chip for Real-Time Applications (IWSOC), pp. 304-310, 2003.- [26] S.R. Vangal, J. Howard, G. Ruhl, S. Dighe, H. Wilson, J. Tschanz, D. Finan, A. Singh, T. Jacob, S. Jain, V. Erraguntla, C. Roberts, Y. Hoskote, N. Borkar, and S. Borkar, "An 80-Tile Sub-100-w Teraflops Processor in 65-nm CMOS,"
IEEE J. Solid-State Circuits, vol. 43, no. 1, pp. 29-41, Jan. 2008.- [27] "PTM: Predictive Technology Model," http:/ptm.asu.edu, 2010.
- [28] J.M. Rabaey, A. Chandrakasan, and B. Nikolic,
Digital Integrated Circuits: A Design Perspective. Prentice Hall, 2002. |