Welcome to the InfoSci Platform
Reference Hub6
Reliable Weighted Globally Congestion Aware Routing for Network on Chip

Reliable Weighted Globally Congestion Aware Routing for Network on Chip

Habib Chawki Touati, Fateh Boutekkouk
Copyright: © 2020 |Volume: 11 |Issue: 3 |Pages: 19
ISSN: 1947-3176|EISSN: 1947-3184|EISBN13: 9781799807018|DOI: 10.4018/IJERTCS.2020070103
Cite Article Cite Article

MLA

Touati, Habib Chawki, and Fateh Boutekkouk. "Reliable Weighted Globally Congestion Aware Routing for Network on Chip." IJERTCS vol.11, no.3 2020: pp.48-66. http://doi.org/10.4018/IJERTCS.2020070103

APA

Touati, H. C. & Boutekkouk, F. (2020). Reliable Weighted Globally Congestion Aware Routing for Network on Chip. International Journal of Embedded and Real-Time Communication Systems (IJERTCS), 11(3), 48-66. http://doi.org/10.4018/IJERTCS.2020070103

Chicago

Touati, Habib Chawki, and Fateh Boutekkouk. "Reliable Weighted Globally Congestion Aware Routing for Network on Chip," International Journal of Embedded and Real-Time Communication Systems (IJERTCS) 11, no.3: 48-66. http://doi.org/10.4018/IJERTCS.2020070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

With the ability to incorporate hundreds of communicating cores on a single chip, thanks to the continuous shrinkage in sizes, communication became of the utmost importance. Consequently, the reduction of transmission delays became unavoidably necessary. All of which is achieved by means of routing algorithms, responsible for selecting the most appropriate routes for data packets, by avoiding congested regions in the network between any pair of source and destination nodes. In this article, two moderately distinct versions in terms of weight distribution of a minimal, fully adaptive, congestion-aware routing scheme in mesh-based network on chip and its accompanying congestion propagation network, are presented. The algorithm does not rely solely on local congestion information nor on irrelevant global information, and provides somewhat a compromise between locally and globally aware routing. The experimental results showcase the proposed scheme's superiority over state of the art NoC routing algorithms.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.