BOTS: Balanced-Objective Task Selector for Application Graph Scheduling in Reconfigurable Computing Systems

سال انتشار: 1398
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 433

متن کامل این مقاله منتشر نشده است و فقط به صورت چکیده یا چکیده مبسوط در پایگاه موجود می باشد.
توضیح: معمولا کلیه مقالاتی که کمتر از ۵ صفحه باشند در پایگاه سیویلیکا اصل مقاله (فول تکست) محسوب نمی شوند و فقط کاربران عضو بدون کسر اعتبار می توانند فایل آنها را دریافت نمایند.

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

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

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

ICIKT10_063

تاریخ نمایه سازی: 5 بهمن 1398

چکیده مقاله:

Hardware-based execution capability with resource reusing flexibility is one of the new features of Reconfigurable Computing (RC) systems. However, due to the reconfiguration constraints, it is difficult to fully exploit their advantages. For a better design with higher performance, several pivotal objectives should be investigated simultaneously such as task execution time, communication data between tasks, and required resources for implementation. In this paper, a new algorithm for task selection in an application graph has been introduced to balance objectives in RC system. This algorithm decides based on a selection merit to reduce the number of execution clusters and to save communication cost as much as possible. To remove forbidden solution, a set of free tasks has been constructed to satisfy the precedence constraints. The evaluation has been performed with different topological features such as parallelism degree and critical path. Results showed that the proposed method provides acceptable improvement in comparison with previous method for application execution time metric

نویسندگان

Milad Gholamrezanejad Ferdos

Iran University of Science and Technology School of Electrical Engineering Tehran, Iran

Hadi Shahriar Shahhoseini

Iran University of Science and Technology School of Electrical Engineering Tehran, Iran