Abstract
As technology scales, fault tolerance is becoming a key concern in on-chip communication. Consequently, this work examines fault tolerant communication algorithms for use in the NoC domain. Two different flooding algorithms and a random walk algorithm are investigated. We show that the flood-based fault tolerant algorithms have an exceedingly high communication overhead. We find that the redundant random walk algorithm offers significantly reduced overhead while maintaining useful levels of fault tolerance. We then compare the implementation costs of these algorithms, both in terms of area as well as in energy consumption, and show that the flooding algorithms consume an order of magnitude more energy per message transmitted.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings - IEEE Computer Society Annual Symposium on VLSI |
| Subtitle of host publication | Emerging Trends in VLSI Systems Design |
| Editors | A. Smailagic, M. Bayoumi |
| Pages | 46-51 |
| Number of pages | 6 |
| DOIs | |
| State | Published - 2004 |
| Event | Proceedings - IEEE Computer Society Annual Symposium on VLSI: Emerging Trends in VLSI Systems Design - Lafayette, LA, United States Duration: Feb 19 2004 → Feb 20 2004 |
Publication series
| Name | Proceedings - IEEE Computer Society Annual Symposium on VLSI: Emerging Trends in VLSI Systems Design |
|---|
Other
| Other | Proceedings - IEEE Computer Society Annual Symposium on VLSI: Emerging Trends in VLSI Systems Design |
|---|---|
| Country/Territory | United States |
| City | Lafayette, LA |
| Period | 2/19/04 → 2/20/04 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 7 Affordable and Clean Energy
All Science Journal Classification (ASJC) codes
- General Engineering
Fingerprint
Dive into the research topics of 'Fault tolerant algorithms for network-on-chip interconnect'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver