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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Alternatives of XY-Routing for Mesh

Published on November 2012 by Lalit Kishore Arora, Raj Kumar
journal_cover_thumbnail

Issues and Challenges in Networking, Intelligence and Computing Technologies
Foundation of Computer Science USA
ICNICT - Number 2
November 2012
Authors: Lalit Kishore Arora, Raj Kumar
e6b7219a-087e-4676-b1c8-af702179bc11

Lalit Kishore Arora, Raj Kumar . Alternatives of XY-Routing for Mesh. Issues and Challenges in Networking, Intelligence and Computing Technologies. ICNICT, 2 (November 2012), 6-8.

@article{
author = { Lalit Kishore Arora, Raj Kumar },
title = { Alternatives of XY-Routing for Mesh },
journal = { Issues and Challenges in Networking, Intelligence and Computing Technologies },
issue_date = { November 2012 },
volume = { ICNICT },
number = { 2 },
month = { November },
year = { 2012 },
issn = 0975-8887,
pages = { 6-8 },
numpages = 3,
url = { /specialissues/icnict/number2/9020-1021/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Special Issue Article
%1 Issues and Challenges in Networking, Intelligence and Computing Technologies
%A Lalit Kishore Arora
%A Raj Kumar
%T Alternatives of XY-Routing for Mesh
%J Issues and Challenges in Networking, Intelligence and Computing Technologies
%@ 0975-8887
%V ICNICT
%N 2
%P 6-8
%D 2012
%I International Journal of Computer Applications
Abstract

The XY-Routing is most popular routing algorithm in the Mesh interconnection networks. This paper propose two new alternatives for XY routing algorithms, indexed-based and level-based routing, which can be easily replace by XY routing.

References
  1. Christopher J. Glass, Lionel M. Ni, "Maximally Fully adaptive routing in 2D Meshes", Technical Report , MSU-CPS-ACS-51, January 12, 1992.
  2. Dara Rahmati, Hamid Sarbazi-Azad, Shaahin Hessabi and Abbas Eslami Kiasari, "Power-efficient Deterministic and Adaptive Routing in Torus Networks-on-Chip", Microprocessors and Microsystems: Embedded Hardware Design
  3. S. Mohiadeen Abdul Kadhar , T. Revathi, "An Efficient Monarchic Reconfiguration Protocol with Deadlock Freedom on Interconnection Networks", International Journal of Computer Applications, vol-43, issue-9, page 1-6, 2012.
  4. O. Lysne, T. Skeie, S. -A. Reinemo, and I. Theiss. Layered routing inirregular networks. IEEE Transactions on Parallel and Distributed Systems,17(1):51–65, 2006.
  5. Andres Mej´?a, Jos´e Flich, Jos´e Duato, Sven-Arne Reinemo, and Tor Skeie. Segment-based routing: An efficient fault-tolerant routing algorithm for meshes and tori. In Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2006). IEEE Computer Society, April 2006
Index Terms

Computer Science
Information Sciences

Keywords

Source Routing Mesh Torus Interconnection Networks Minimal Path