Adaptive inter-layer message routing in 3D networks-on-chip

Autor: Lorena Anghel, Claudia Rusu, Dimiter R. Avresky
Přispěvatelé: EADS, Corporate Research Center, EADS Paris, Techniques of Informatics and Microelectronics for integrated systems Architecture (TIMA), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), International Research Institute for Autonomic Network Computing [Munich] (IRIANC), Techniques de l'Informatique et de la Microélectronique pour l'Architecture des systèmes intégrés (TIMA), Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)
Rok vydání: 2011
Předmět:
Routing protocol
Dynamic Source Routing
Computer Networks and Communications
Computer science
Equal-cost multi-path routing
Distributed computing
Routing table
Enhanced Interior Gateway Routing Protocol
Wireless Routing Protocol
02 engineering and technology
Network topology
01 natural sciences
Routing Information Protocol
Artificial Intelligence
0103 physical sciences
Hardware_INTEGRATEDCIRCUITS
0202 electrical engineering
electronic engineering
information engineering
Destination-Sequenced Distance Vector routing
[SPI.NANO]Engineering Sciences [physics]/Micro and nanotechnologies/Microelectronics
Hierarchical routing
Triangular routing
010302 applied physics
Static routing
Zone Routing Protocol
business.industry
Policy-based routing
Path vector protocol
020202 computer hardware & architecture
networks on chip
Distance-vector routing protocol
Routing domain
Link-state routing protocol
Hardware and Architecture
PACS 85.42
Multipath routing
Hazy Sighted Link State Routing Protocol
business
Software
Computer network
Zdroj: Microprocessors and Microsystems: Embedded Hardware Design (MICPRO)
Microprocessors and Microsystems: Embedded Hardware Design (MICPRO), Elsevier, 2011, 35 (7), pp.613-631. ⟨10.1016/j.micpro.2011.06.008⟩
ISSN: 0141-9331
DOI: 10.1016/j.micpro.2011.06.008
Popis: International audience; Existing routing algorithms for 3D deal with regular mesh/torus 3D topologies. Today 3D NoCs are quite irregular, especially those with heterogeneous layers. In this paper, we present a routing algorithm targeting 3D networks-on-chip (NoCs) with incomplete sets of vertical links between adjacent layers. The routing algorithm tolerates multiple link and node failures, in the case of absence of NoC partitioning. In addition, it deals with congestion. The routing algorithm for 3D NoCs preserves the deadlock-free propriety of the chosen 2D routing algorithms. It is also scalable and supports a local reconfiguration that complements the reconfiguration of the 2D routing algorithms in case of failures of nodes or links. The algorithm incurs a small overhead in terms of exchanged messages for reconfiguration and does not introduce significant additional complexity in the routers. Theoretical analysis of the 3D routing algorithm is provided and validated by simulations for different traffic loads and failure rates.
Databáze: OpenAIRE
Externí odkaz: