Design of a high speed router for NOC

The complexity of System on Chip (SoC) is increasing with the scale of ICs, and Network on Chip (NoC) has become one of the most important solutions for SoC communication. As a significant point of NoC, research of routers and routing algorithms is receiving more and more attention from researchers and research institutes. This paper proposes a high-speed router on-chip router, which adopts wormhole switching mechanism, output queuing caching strategy, Credit-based flow control mechanism and Round-Robin arbitration mechanism, and the entire operation of the router is a two-stage flow. The selection of adaptive and deterministic routing algorithms can be done automatically, and finally, the performance parameters are evaluated.

PERFORMANCE ENHANCEMENT IN IRREGULAR NETWORK USING MULTIPLE ROOT

Irregular network is one of cheaper option for high-parallel performance computing from chip level to large workstation. Irregular networks provide wire flexibility as well as scalable system. But Irregular network always have problem of deadlock in routing and channel utilization. Different solution has been already proposed such as Prefix Routing [1], Up/Down Routing [1], L-turn routing [2], cut Through Switching [9],Wormhole switching [3]. But all these algorithms have different performance in different networks means their performance is depended on network topology and root that is selected during routing in directional routing and prefix routing. In this paper we have proposed a methodology by which we can select a better root for spanning tree, some solution to improve over all utilization of channel for Up/down algorithms and prefix Routing [1].

Schedulability Analysis for Real Time On-Chip Communication with Wormhole Switching

In this paper, the authors discuss a real-time on-chip communication service with a priority-based wormhole switching policy. The authors present a novel off-line schedulability analysis approach, worst case network latency analysis. By evaluating diverse inter-relationships and service attributes among the traffic flows, this approach can predict the packet network latency for all practical situations. The simulation results provide evidence that communication latency calculated using the real time analysis approach is safe, closely matching the figures obtained from simulation.