Routing Algorithms in Networks-on-Chip

Maurizio Palesi, Masoud Daneshtalab (Herausgeber)

Buch | Softcover

410 Seiten

2016 | Softcover reprint of the original 1st ed. 2014
Springer-Verlag New York Inc.
978-1-4939-5511-4 (ISBN)

Artikel merken

This book provides a single-source reference to routing algorithms for Networks-on-Chip (NoCs), as well as in-depth discussions of advanced solutions applied to current and next generation, many core NoC-based Systems-on-Chip (SoCs). After a basic introduction to the NoC design paradigm and architectures, routing algorithms for NoC architectures are presented and discussed at all abstraction levels, from the algorithmic level to actual implementation. Coverage emphasizes the role played by the routing algorithm and is organized around key problems affecting current and next generation, many-core SoCs. A selection of routing algorithms is included, specifically designed to address key issues faced by designers in the ultra-deep sub-micron (UDSM) era, including performance improvement, power, energy, and thermal issues, fault tolerance and reliability.

Part I Performance Improvement.- Basic Concepts on On-Chip Networks.- A Heuristic Framework for Designing and Exploring Deterministic Routing Algorithm for NoCs.- Run-Time Deadlock Detection.- The Abacus Turn Model.- Learning-based Routing Algorithms for on-Chip Networks.- Part II Multicast Communication.- Efficient and Deadlock-Free Tree-based Multicast Routing Method for Network-on-Chip.- Path-based Multicast Routing for 2D and 3D Mesh Networks.- Part III Fault Tolerance and Reliability.- Fault-Tolerant Routing Algorithms in Networks-on-Chip.- Reliable and Adaptive Algorithms for 2D and 3D Networks-on-Chip.

Erscheinungsdatum	02.09.2016
Zusatzinfo	97 Illustrations, color; 122 Illustrations, black and white; XIV, 410 p. 219 illus., 97 illus. in color.
Verlagsort	New York
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Mathematik / Informatik ► Informatik ► Theorie / Studium
Themenwelt	Technik ► Elektrotechnik / Energietechnik
ISBN-10	1-4939-5511-X / 149395511X
ISBN-13	978-1-4939-5511-4 / 9781493955114
Zustand	Neuware