CAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip

سال انتشار: 1398
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 404

فایل این مقاله در 8 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_JACET-5-4_001

تاریخ نمایه سازی: 20 آذر 1398

چکیده مقاله:

By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tolerance methods is one of the principles of today s chip design. Faults may have undesirable effects on the correct system operation and system performance. In this paper the communication infrastructure failure has been considered as same as link and router failure and the fault tolerance low cost routing algorithm has been suggested base on local fault information By using quad neighbor fault information to avoid back tracking in routing in order to select possible minimal path to destination. In this article, we have suggested cost aware fault tolerance (CAFT) routing algorithm. Our contribution in this algorithm is minimum local fault information, minimum routing decision overhead by implementing routing logic base and determining shortest possible path. For deadlock freedom using an additional virtual channel along Y dimension and prohibiting certain routing turns. In order to evaluate the performance of our routing, we compared it with other fault tolerant routing in terms of average packet latency, throughput and power.

نویسندگان

Akram Reza

Department of Computer Engineering, Shahr-e-Qods Branch, Islamic Azad University, Tehran, Iran

Parisa Jolani

Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran.

Midia Reshadi

Computer Engineering Department, Science and Research Branch, Islamic Azad University,Tehran,Iran

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • Moadeli, M., Shahrabi, A., Vanderbauwhede, W. and Ould-Khaoua, M., 2007, ...
  • Yaghini, P.M., Eghbal, A. and Bagherzadeh, N., 2015. On the ...
  • Wu, Z., Fu, F., Lu, Y. and Wang, J., 2015. ...
  • Ahmed, A.B. and Abdallah, A.B., 2014. Graceful deadlock-free fault-tolerant routing ...
  • Duato, J., 1995. A necessary and sufficient condition for deadlock-free ...
  • Glass, C.J. and Ni, L.M., 1998, August. The turn model ...
  • Xie, R., Cai, J. and Xin, X., 2016. Simple fault-tolerant ...
  • Xie, R., Cai, J. and Xin, X., 2016. Simple fault-tolerant ...
  • Glass, C.J. and Ni, L.M., 1996. Fault-tolerant wormhole routing in ...
  • Dally, W.J. and Seitz, C.L., 1988. Deadlock-free message routing in ...
  • Valinataj, M., Mohammadi, S., Plosila, J., Liljeberg, P. and Tenhunen, ...
  • Zhou, J., Li, H., Wang, T. and Li, X., 2016. ...
  • Huang, L., Zhang, X., Ebrahimi, M. and Li, G., 2016. ...
  • Kumar, M., Laxmi, V., Gaur, M.S., Daneshtalab, M., Ebrahimi, M. ...
  • Ebrahimi, M., Daneshtalab, M. and Plosila, J., 2013, February. High ...
  • Valinataj, M., Mohammadi, S., Plosila, J., Liljeberg, P. and Tenhunen, ...
  • Sinha, D., Roy, A., Kumar, K.V., Kulkarni, P. and Soumya, ...
  • Xie, R., Cai, J., Xin, X. and Yang, B., 2017. ...
  • M. Palesi, D. Patti and F. Fazzino, http://www.noxim.org/, University of ...
  • نمایش کامل مراجع