Towards Maximum Utilization of Remained Bandwidth in Defected NoC Links
Pages 285 - 298
Abstract
To maximize the utilization of the available networks-on-chip (NoCs) link bandwidth, partially faulty links with low fault level should be utilized while heavily defected (HD) links should be deactivated and dealt with by means of a fault tolerant routing algorithm. To reach this target, we make the following contributions in this paper: 1) we propose a flit serialization (FS) method to efficiently utilize partially faulty links. The FS approach divides the links into a number of equal width sections, and serializes sections of adjacent flits to transmit them on all fault-free link sections to mitigate the unbalance between the flit size and the actual link bandwidth; 2) we propose the link augmentation with one redundant section as a low cost mechanism to mitigate the FS drawback that a link’s available bandwidth is reduced even if it contains only one faulty wire; and 3) we deactivate HD links when their fault level exceed a certain threshold to diminish congestion caused by HD links. The optimal threshold is derived by comparing the zero load packet transmission latency on the HD links and that on the shortest alternative path. Our proposal is evaluated with synthetic traffic and PARSEC benchmarks. Experimental results indicate that the FS method can achieve lower area*power/saturation_throughput value than all state of the art link fault tolerant strategies. With a redundant section in each link, the NoC saturation throughput can be largely improved than just utilizing FS, e.g., 18% when 10% of the NoC wires are broken. Simulation results we obtained at various wire broken rate configurations indicate that we achieve the highest saturation throughput if 4- or 8-section links with a flit transmission latency longer than four cycles are deactivated.
References
[1]
G. Blake, R. G. Dreslinski, and T. Mudge, “ A survey of multicore processors,” IEEE Signal Process. Mag., vol. Volume 26, no. Issue 6, pp. 26–37, 2009.
[2]
T. Dumitras, S. Kerner, and R. Marculescu, “ Towards on-chip fault-tolerant communication,” in Proc. Asia South Pac. Design Autom. Conf., Kitakyushu, Japan, Jan. 2003, pp. 225–232.
[3]
T. Bjerregaard and S. Mahadevan, “ A survey of research and practices of network-on-chip,” ACM Comput. Surveys, vol. Volume 38, no. Issue 1, pp. 1–51, 2006.
[4]
C. Grecu, A. Ivanov, R. Saleh, and P. P. Pande, “ NoC interconnect yield improvement using crosspoint redundancy,” in Proc. IEEE Int. Symp. Defect Fault Tolerance VLSI Syst., Arlington, VA, USA, Oct. 2006, pp. 457–465.
[5]
O. S. Unsal et al., “ Impact of parameter variations on circuits and microarchitecture,” IEEE Micro, vol. Volume 26, no. Issue 6, pp. 30–39, 2006.
[6]
C. Hernandez, F. Silla, V. Santonja, and J. Duato, “ A new mechanism to deal with process variability in NoC links,” in Proc. IEEE Int. Symp. Parallel Distrib. Process., Rome, Italy, May 2009, pp. 1–11.
[7]
S. Borkar, “ Designing reliable systems from unreliable components: The challenges of transistor variability and degradation,” IEEE Micro, vol. Volume 25, no. Issue 6, pp. 10–16, 2005.
[8]
C. Bienia, “ Benchmarking modern multiprocessors,” Dept. Comput. Sci ., Princeton Univ ., Princeton, NJ, USA, 2011.
[9]
T. Lehtonen, D. Wolpert, P. Liljeberg, J. Plosila, and P. Ampadu, “ Self-adaptive system for addressing permanent errors in on-chip interconnects,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. Volume 18, no. Issue 4, pp. 527–540, 2010.
[10]
A. Vitkovskiy, V. Soteriou, and C. Nicopoulos, “ A fine-grained link-level fault-tolerant mechanism for networks-on-chip,” in Proc. IEEE Int. Conf. Comput. Design, Amsterdam, The Netherlands, Oct. 2010, pp. 447–454.
[11]
M. Palesi, S. Kumar, and V. Catania, “ Leveraging partially faulty links usage for enhancing yield and performance in networks-on-chip,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. Volume 29, no. Issue 3, pp. 426–440, 2010.
[12]
T. Lehtonen, P. Liljeberg, and J. Plosila, “ Online reconfigurable self-timed links for fault tolerant NoC,” VLSI Design, vol. Volume 2007, pp. 1–13, 2007. .
[13]
Q. Yu and P. Ampadu, “ Transient and permanent error co-management method for reliable networks-on-chip,” in Proc. IEEE/ACM Int. Symp. Netw. Chip, Grenoble, France, Jul. 2010, pp. 52–59.
[14]
F. Farahnakian, M. Ebrahimi, M. Daneshtalab, J. Plosila, and P. Liljeberg, “ Optimized Q-learning model for distributing traffic in on-chip networks,” in Proc. IEEE Int. Conf. Netw. Embedded Syst. Every Appl ., Liverpool, U.K., Dec. 2012, pp. 1–8.
[15]
G. Ascia, V. Catania, M. Palesi, and D. Patti, “ Implementation and analysis of a new selection strategy for adaptive routing in networks-on-chip,” IEEE Trans. Comput., vol. Volume 57, no. Issue 6, pp. 809–820, 2008.
[16]
M. Ebrahimi et al., “ HARAQ: Congestion-aware learning model for highly adaptive routing algorithm in on-chip networks,” in Proc. IEEE/ACM Int. Symp. Netw. Chip, Copenhagen, Denmark, May 2013, pp. 19–26.
[17]
M. Palesi, S. Kumar, and V. Catania, “ Bandwidth-aware routing algorithms for networks-on-chip platforms,” IET Comput. Digit. Tech., vol. Volume 3, no. Issue 5, pp. 413–429, 2009.
[18]
L. Schwiebert and D. N. Jayasimha, “ Optimal fully adaptive wormhole routing for meshes,” in Proc. Supercomput., Portland, OR, USA, Nov. 1993, pp. 782–791.
[19]
C. Grecu, A. Ivanov, R. Saleh, and P. P. Pande, “ Testing network-on-chip communication fabrics,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. Volume 26, no. Issue 12, pp. 2201–2213, 2007.
[20]
E. Salminen, A. Kulmala, and T. Hamalainen, “ Survey of network-on-chip proposals,” White Paper, Open Core Protocol Int. Partnership (OCP-IP), 2008.
[21]
W. J. Dally and B. Towles, Principles and Practices of Interconnection Networks . San Francisco, CA, USA: Morgan Kaufmann, 2003.
[22]
W. Tsai, D.-Y. Zhen, S.-J. Chen, and Y.-H. Hu, “ A fault-tolerant NoC scheme using bidirectional channel,” in Proc. Design Autom. Conf., New York, NY, USA, Jun. 2011, pp. 918–923.
[23]
R. Tamhankar et al., “ Timing-error-tolerant network-on-chip design methodology,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. Volume 26, no. Issue 7, pp. 1297–1309, 2007.
[24]
C. Chen and S. D. Cotofana, “ Towards an effective utilization of partially defected interconnections in 2D mesh NoCs,” in Proc. Int. Symp. VLSI, Tampa, FL, USA, Jul. 2014, pp. 492–497.
[25]
M. Ebrahimi, M. Daneshtalab, J. Plosila, and H. Tenhunen, “ Minimal-path fault-tolerant approach using connection-retaining structure in networks-on-chip,” in Proc. IEEE/ACM Int. Symp. Netw. Chip, Tempe, AZ, USA, Apr. 2013, pp. 1–8.
[26]
C. Glass and L. Ni, “ Fault-tolerant wormhole routing in meshes without virtual channels,” IEEE Trans. Parallel Distrib. Syst., vol. Volume 7, no. Issue 6, pp. 620–636, 1996.
[27]
S. Chalasani and R. V. Boppana, “ Communication in multicomputers with nonconvex faults,” IEEE Trans. Comput., vol. Volume 46, no. Issue 5, pp. 616–622, 1997.
[28]
C.-L. Chen and G.-M. Chiu, “ A fault-tolerant routing scheme for meshes with nonconvex faults,” IEEE Trans. Parallel Distrib. Syst., vol. Volume 12, no. Issue 5, pp. 467–475, 2001.
[29]
C. Chen and S. D. Cotofana, “ An effective routing algorithm to avoid unnecessary link abandon in 2D mesh NoCs,” in Proc. Euromicro Conf. Digit. Syst. Design, Los Alamitos, CA, USA, Sep. 2013, pp. 311–318.
[30]
S.-P. Kim and T. Han, “ Fault-tolerant wormhole routing in mesh with overlapped solid fault regions,” Parallel Comput., vol. Volume 23, no. Issue 13, pp. 1937–1962, 1997.
[31]
K. Aisopos, A. DeOrio, L.-S. Peh, and V. Bertacco, “ ARIADNE: Agnostic reconfiguration in a disconnected network environment,” in Proc. Int. Conf. Parallel Archit. Compilation Tech., Galveston, TX, USA, Oct. 2011, pp. 298–309.
[32]
F. Chaix, D. Avresky, N.-E. Zergainoh, and M. Nicolaidis, “ Fault-tolerant deadlock-free adaptive routing for any set of link and node failures in multi-cores systems,” in Proc. IEEE Int. Symp. Netw. Comput. Appl., Cambridge, MA, USA, Jul. 2010, pp. 52–59.
[33]
V. Puente, J. A. Gregorio, F. Vallejo, and R. Beivide, “ Immunet: Dependable routing for interconnection networks with arbitrary topology,” IEEE Trans. Comput., vol. Volume 57, no. Issue 12, pp. 1676–1689, 2008.
[34]
Y. Lu, J. McCanny, and S. Sezer, “ Exploring virtual-channel architecture in FPGA based networks-on-chip,” in Proc. IEEE Int. SOC Conf., Taipei, Taiwan, Sep. 2011, pp. 302–307.
[35]
J. Hestness and S. W. Keckler, “ Netrace: Dependency-tracking traces for efficient network-on-chip experimentation,” Dept. Comput. Sci ., Univ. Texas at Austin, Austin, TX, USA, Tech. Rep. TR-10-11, 2010.
[36]
N. L. Binkert et al., “ The M5 simulator: Modeling networked systems,” IEEE Micro, vol. Volume 26, no. Issue 4, pp. 52–60, 2006.
Recommendations
Silicon Photonic Microring Links for High-Bandwidth-Density, Low-Power Chip I/O
Silicon photonic microrings have drawn interest in recent years as potential building blocks for high-bandwidth off-chip communication links. The authors analyze a terabit-per-second scale unamplified microring link based on current best-of-class ...
3D NoC with Inductive-Coupling Links for Building-Block SiPs
A wireless 3D NoC architecture is described for building-block SiPs, in which the number of hardware components (or chips) in a package can be changed after chips have been fabricated. The architecture uses inductive-coupling links that can connect more ...
Serialized asynchronous links for NoC
DATE '08: Proceedings of the conference on Design, automation and test in EuropeThis paper proposes an asynchronous serialized link for NoC that can achieve the same levels of performance in terms of flits per second as a synchronous link but with a reduced number of wires in the point to point switch links and reduced power ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2017.
Publisher
IEEE Press
Publication History
Published: 01 February 2017
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Feb 2025