Design and Simulation of Fault Tolerant Algorithms in Network-on-Chip

Message:
Abstract:
Increase of design complexity of assembled circuits, and on the other hand necessity to separation the activity of computational and communicational parts in today chips, drives design way to terminals base on network on chips.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, and compares them in terms of the functional parameters. Then introduces a algorithm with purpose of encounter permanent and transient faults with appropriate functional levels. In this manner that against of permanent faults that exist structural in network on chip, packet has a expectation ability and finally return source to find another path and information bits are protected by a cyclic redundancy code (CRC) and Switch-to-Switch Error Control Policies (link level), against of transient faults. with appearance of fault, because of existence several sorts of the same packet in network, it will be discarded. R eceiver doesn’t need to request of retransmission because it will receive redundant of packet from the same or another path.
Language:
Persian
Published:
Journal of Modeling in Engineering, Volume:7 Issue: 16, 2009
Page:
33
magiran.com/p828010  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!