CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Cellular Automata based Degree Priority Routing Algorithm for Irregular Mesh Topology NOCs

by Chayan Banerjee, Amol K. Boke
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 66 - Number 22
Year of Publication: 2013
Authors: Chayan Banerjee, Amol K. Boke
10.5120/11251-6463

Chayan Banerjee, Amol K. Boke . Cellular Automata based Degree Priority Routing Algorithm for Irregular Mesh Topology NOCs. International Journal of Computer Applications. 66, 22 ( March 2013), 40-44. DOI=10.5120/11251-6463

@article{ 10.5120/11251-6463,
author = { Chayan Banerjee, Amol K. Boke },
title = { Cellular Automata based Degree Priority Routing Algorithm for Irregular Mesh Topology NOCs },
journal = { International Journal of Computer Applications },
issue_date = { March 2013 },
volume = { 66 },
number = { 22 },
month = { March },
year = { 2013 },
issn = { 0975-8887 },
pages = { 40-44 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume66/number22/11251-6463/ },
doi = { 10.5120/11251-6463 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:23:09.259792+05:30
%A Chayan Banerjee
%A Amol K. Boke
%T Cellular Automata based Degree Priority Routing Algorithm for Irregular Mesh Topology NOCs
%J International Journal of Computer Applications
%@ 0975-8887
%V 66
%N 22
%P 40-44
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Irregular mesh topologies are used nowadays in NOCs due to the variation in the size & shape of IP modules integrated on a SOC. Irregular topology presents problems of routing, as eachnode may differ in their degree. Degree priority routing algorithms have already been proposed, which enables fast and dynamic routing. In this paper an improvement on the existing Degree priority routing (DPR) algorithm is proposed, by introducing Cellular Automata based neighborhood into the picture. The proposed technique enables each node to retain the degree information of its 4 neighbors (in a Cellular automata based Von Neumann neighborhood)and serves as a 'one node' hub to decide on the next best node to route the message to. This way a considerable amount of time is saved on DPR algorithms to route the message to the next best node with the optimal degree.

References
  1. Stephen Wolfram, A New Kind Of Science, Wolfram Media, Inc.
  2. Wang Zhang, Ligang Hou, Jinhui Wang, Shuqin Geng, Wuchen Wu, 2011, Comparison Research between XY and Odd-Even Routing Algorithm of a 2-Dimension 3X3 Mesh Topology Network-on-Chip.
  3. Ling Wang Hui Song, Yingtao Jiang, Degree Priority Routing Algorithm for Irregular Mesh Topology NoCs, ICESS2008.
  4. Jie Chen and Cheng Li,Paul Gillard, Network-on-Chip(NOC)Topologies and Performance: A Review
  5. Yung-Chang Chang, Ching-Te Chiu, A Study of NoC Topologies and Switching Arbitration Mechanisms, 2012 IEEE 14th International Conference on High Performance.
  6. Shubhangi D Chawade, Mahendra A Gaikwad & Rajendra M Patrikar, Review Of XY Routing Algorithm forNetwork-On-Chip Architecture.
  7. www. wikipedia. org
Index Terms

Computer Science
Information Sciences

Keywords

Cellular automata Von Neumann neighborhood irregular mesh topology Degree priority routing XY routing algorithm

Powered by PhDFocusTM