The Hamiltonian-based odd–even turn model for maximally adaptive routing in 2D mesh networks-on-chip. (July 2015)

• Record Type: Journal Article
• Authors: Bahrebar, Poona; Stroobandt, Dirk
• Is Part Of: Computers & electrical engineering. Volume 45(2015)
• Page Start: 386
• Page End: 401
• Publication Date: 2015-07
• Subjects: Network-on-Chip (NoC) -- Adaptive routing methods -- Deadlock -- Turn model -- Hamiltonian path-based routing strategy; Computer engineering -- Periodicals; Electrical engineering -- Periodicals; Electrical engineering -- Data processing -- Periodicals; Ordinateurs -- Conception et construction -- Périodiques; Électrotechnique -- Périodiques; Électrotechnique -- Informatique -- Périodiques; Computer engineering; Electrical engineering; Electrical engineering -- Data processing; Periodicals; Electronic journals; 621.302854
• DOI: 10.1016/j.compeleceng.2014.12.009
• Languages: English
• ISSNs: 0045-7906

Abstract

Graphical abstract: Highlights: A highly adaptive routing method is proposed for wormhole-switched 2D mesh networks. The degree of adaptiveness is maximized by minimizing the number of prohibited turns. The deadlock-freedom is guaranteed without adding virtual channels. The proposed method is minimal and can be used for unicast/multicast routing. The number of hotspots is diminished and the traffic distribution is efficient. Abstract: Networks-on-Chip (NoCs) have emerged as a promising solution for the communication crisis in today's high-performance Multi-Processor System-on-Chip (MPSoC) architectures. Routing methods have a prominent role in taking advantage of the potential benefits offered by NoCs. As a result, designing high-performance and efficient routing algorithms is highly desirable. In this paper, the Hamiltonian-based Odd–Even (HOE) turn model is proposed for both unicast and multicast routing in wormhole-switched 2D mesh networks. HOE is able to maximize the degree of adaptiveness by minimizing the number of prohibited turns, such that the algorithm remains deadlock-free without adding virtual channels. By increasing the number of alternative minimal paths, the hotspots are less likely to be created and the traffic is efficiently distributed throughout the network. The simulation results in terms of latency and power consumption indicate the better performance of the proposed method in comparison with the existing routing methods.