Deadlock Free Routing Algorithm for Minimizing Data Packet Transmission in Network on Chip

Deadlock Free Routing Algorithm for Minimizing Data Packet Transmission in Network on Chip

K. Somasundaram (Amrita Vishwa Vidyapeetham, India and University of Turku, Finland) and Juha Plosila (University of Turku and Academy of Finland, Finland)
DOI: 10.4018/jertcs.2012010104
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Network on chip (NoC) has been proposed as a solution for addressing the design challenges of future high performance nanoscale architectures. In NoCs, the traditional routing schemes are routing packets through a single path or multiple paths from one source node to a destination node, minimizing the congestion in the routing architecture. Although these routing algorithms are moderately efficient, they are time dependent. To reduce overall data packet transmission time in the network, the authors consider a network with multiple sources and multiple destinations. Multi-dimensional routing problems appear naturally in several resource allocation problems, communication networks and wireless sensor networks. In this paper, the authors have constructed a deadlock-free multi-dimensional path routing algorithm for minimizing the congestion in NoC.
Article Preview

1. Introduction

Systems on Chip (SoC) grow in complexity with the advancement of semiconductor technology enabling integration of dozens of cores on a chip. The continuously increasing number of cores calls for a new communication architecture as traditional architectures are inherently nonscalable, making communication a bottleneck. System architectures are shifting towards a more communication centric methodology. Network on Chip (NoC) has emerged as the design paradigm for design of scalable on-chip communication architectures, providing better structure and modularity than its predecessors (De Michel & Benini, 2006; Rantala, Lehtonen, & Plosila, 2006).

Figure 1 illustrates the implementation of the system d695 from the ITC’02 SoC Test benchmarks suit in SOCIN topology (Marinissen, Iyengar, & Chakrabarty, 2002). This is also a topological aspect of a 4×4 mesh NoC, which shows a model of global level on-chip communication. Instead of busses and dedicated point-to-point links, a more general scheme is adopted by employing a grid of routing nodes spread out across the chip and connected by communication links. Such regular and parallel structures are very attractive because they can offer well-controlled electrical parameters which enable high-performance circuits by reducing latency and increasing bandwidth. From this perspective, the SoC design will resemble more the creation of large scale communication networks rather than traditional IC design practice.

Figure 1.

4×4 mesh NoC

The simple 4×4 mesh NoC in Figure 1 consists of Network Interfaces (NIs), Cores, Routers and Links. One Network Interface (NI) is needed to connect each IP core to the NoC. Network Interfaces are converting the transaction request/response into packets and vice versa. For example, in ×pipes (Bertozzi & Benini, 2004; Dall'Osso, Biccari, Giovannini, Bertozzi, & Benini, 2003), two separate NIs are defined for system master and system slaves. The NIs implement the interface by which the cores are connected to the NoC, decoupling computation (the cores) from communication (the network). Links are connected between the nodes with either static or dynamic bandwidth. They may consist of one or more logical or physical channels. The routing methods can be applied either after NoC topology mapping and design or during the mapping process itself. Routing nodes are required to route the data according to chosen protocols, implementing the desired routing strategies.

The general routing schemes in the NoC are either static or dynamic. In static routing, bandwidth and the traffic flows are fixed. On the other hand, in the case of dynamic routing, the paths are selected based on the current bandwidth and traffic flow characteristics of the network. In most of the NoC designs the bandwidth and data width are fixed. Creating a NoC based system requires selection of cores for various purposes and efficient mapping of the cores on the platform. Design choices include binding between core ports and network ports, communication between cores, and allocation of network channel capacity. In most of the NoC designs the bandwidth and data width are fixed, because frequent dynamic changes in traffic flows and routing paths would mean dynamic hop counts and a complex on-chip system implementation. Therefore, in this paper, we concentrate on static routing only.

This paper is organized as follows: A brief review of routing algorithms is given in the next section. Section 3 gives some basic definitions and notations and shows a mathematical model for our problem. In Section 4, we focus on the path selection procedure and its existence. A multi-dimensional flow algorithm for minimizing the data packet transmission is discussed in Section 5. Our experimental results are given in Section 6. Finally, we draw some conclusions in Section 7.

2. Previous Work

General single path routing algorithms are well studied by many authors (Anido & Seeto, 1988; Banner & Orda, 2007; Faloutsos, 1999; Wang, Jin, Kim, & Malik, 2002). Current routing schemes typically focus on discovering a single or multiple optimal paths for routing from one source to one destination (Banner & Orda, 2007; Bjerregaard & Mahadevan, 2006).

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 9: 2 Issues (2018): 1 Released, 1 Forthcoming
Volume 8: 2 Issues (2017)
Volume 7: 2 Issues (2016)
Volume 6: 2 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing