Row/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips

Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first approaches is done based on the location of multicast source node i.e., how the multicast source is far from right/left and top/bottom margins of the mesh network. In this way, the proposed algorithm improves two performance criteria i.e., traffic and communication latency as compared with the well-known Column-Path multicast algorithm. In order to evaluate the proposed algorithm, an analytical model is developed to estimate the mentioned performance criteria. The modeling and simulation results show improvement of 10 and 20 percent on traffic and communication latency respectively for Row/Column-First algorithm as compared to the Column-Path algorithm.
Language:
English
Published:
Iranian Journal of Electrical and Electronic Engineering, Volume:14 Issue: 2, Jun 2018
Pages:
124 to 136
magiran.com/p1833145  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!