Fault-Tolerant Circular Routing Algorithm for 3D-NoC

Alizadeh, RaziehShahidBahonar Univ Kerman, Dept Elect Engn, Kerman, Iran. (författare)

QC 20190207
ExpandingNetworks-on-Chip (NoCs) to the third dimension (3D-NoC) has been known as a promising solution for the latency challenges of future many-core Systems-on-Chip. 3D-NoC may take advantages of TSVsfor vertical links which are shorter and faster than horizontal ones. Faults may occur in TSVs as well as the horizontal links though faults inTSVs are more costly. In this paper, we present a fault-tolerant routing algorithm targeting faults in both TSVs and horizontal links. The proposed routing algorithm is based on defining some circular routing paths which offers a deadlock-free routing for packets in mesh-based topologies. In addition to tolerating faults, these circular pathshelp in reducing congestion in the centralpart of the network at high injection rates. The proposed circular routing algorithm is able to tolerate all one-faulty links. In addition, it is shown that its performance is better than those of traditional methods.

Saneei, MohsenShahidBahonar Univ Kerman, Dept Elect Engn, Kerman, Iran. (författare)
Ebrahimi, MasoumehKTH,Skolan för elektro- och systemteknik (EES)(Swepub:kth)u1itvie3 (författare)
ShahidBahonar Univ Kerman, Dept Elect Engn, Kerman, Iran.Skolan för elektro- och systemteknik (EES) (creator_code:org_t)

Ingår i:2014 INTERNATIONAL CONGRESS ON TECHNOLOGY, COMMUNICATION AND KNOWLEDGE (ICTCK): IEEE9781479980215

Av författaren/redakt...: Alizadeh, Razieh; Saneei, Mohsen; Ebrahimi, Masoum ...

Om ämnet

TEKNIK OCH TEKNOLOGIER: TEKNIK OCH TEKNO ...; och Elektroteknik oc ...; och Kommunikationssy ...

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.