CAFT: Cost-aware and Fault-tolerant Routing Algorithm in 2D Mesh Network-on-Chip

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Reza Akram; Jolani Parisa; RESHADI MIDIA

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY Year:2019 | Volume:5 | Issue:4 Page(s): 205-212

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

CAFT: Cost-aware and Fault-tolerant Routing Algorithm in 2D Mesh Network-on-Chip

Author(s)

Reza Akram | Jolani Parisa | RESHADI MIDIA | Issue Writer Certificate

Keywords

Network-on-Chip

Fault tolerance

Deadlock-free

routing algorithm

2D-NOC

Adaptive routing

Abstract

By increasing, the complexity of chips and integrating more components into a chip has made network – on-chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of fault in the chip network increases and providing correction and Fault tolerance methods is one of the principles of today's chip design. Faults may have undesirable effects on the correct system operation and system performance. In this paper the communication infrastructure fault has been considered as same as link and router fault and the Fault tolerance low cost routing algorithm has been suggested base on local fault information By using quad neighbor fault information to avoid back tracking in routing in order to select possible minimal path to destination. In this article, we have suggested cost aware Fault tolerance (CAFT) routing algorithm. Our contribution in this algorithm is minimum local fault information, minimum routing decision overhead by implementing routing logic base and determining shortest possible path. For deadlock freedom using an additional virtual channel along Y dimension and prohibiting certain routing turns. In order to evaluate the performance of our routing, we compared it with other fault tolerant routing in terms of average packet latency, throughput and power.

Cites

No record.

References

No record.

Cite

APA: Copy

Reza, Akram, Jolani, Parisa, & RESHADI, MIDIA. (2019). CAFT: Cost-aware and Fault-tolerant Routing Algorithm in 2D Mesh Network-on-Chip. JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY, 5(4), 205-212. SID. https://sid.ir/paper/703738/en

Vancouver: Copy

Reza Akram, Jolani Parisa, RESHADI MIDIA. CAFT: Cost-aware and Fault-tolerant Routing Algorithm in 2D Mesh Network-on-Chip. JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY[Internet]. 2019;5(4):205-212. Available from: https://sid.ir/paper/703738/en

IEEE: Copy

Akram Reza, Parisa Jolani, and MIDIA RESHADI, “CAFT: Cost-aware and Fault-tolerant Routing Algorithm in 2D Mesh Network-on-Chip,” JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY, vol. 5, no. 4, pp. 205–212, 2019, [Online]. Available: https://sid.ir/paper/703738/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops