Priority-Based Scheduling and Evaluation of Precedence Graphs with Communication Times

الموضوعات

علوم تطبيقية وتكنولوجية

الملخص

The design of distributed schemes requires partitioning a computation into smaller modules and scheduling it over a number of processors that communicate by exchanging packets of messages. The computation is represented by a directed acyclic graph. The objective function is to minimize the overall computation time. Due to the dynamic nature of the inter-tasks communication, an accurate global estimation of their effect is hard to find. As a result, local scheduling heuristic are used. In this work, new global priority based scheduling algorithms are presented, based on the evaluation of tasks finish times in the reverse graph. Extensive testing is carried out to evaluate the performance of these heuristics. Analysis of the results shows the superiority of these heuristics over reported ones as shorter finish times can be achieved with a stable topology independent performance. Finally, a new low-cost general iterative improvement technique is presented. Experimental testing of this technique is conducted with an analysis of the process behavior.

روابط وملفات

التعريف والنوع

رقم الوثيقة

f0a3c534-76a8-499c-b0fc-1bf6bcd7c550

رقم العقد

0

نوع الوسائط

Crawler

نوع المحتوى

الرسائل العلمية

صيغة المصدر

رسائل ماجيستير

نوع الملف

pdf text

أسماء الملفات

943828_1.pdf

بيانات النشر

ترجمة العنوان

جدولة وتقويم المخططات البيانية ذات الأولوية والاتصالات على أساس الأفضلية

ألقاب المؤلفين

[{"name_ar":"حبيب يوسف","title_ar":"اشراف","title_en":"Supervision"},{"name_ar":"عادل محمد عادل المعصراني ","title_ar":"اعداد","title_en":"Preparation"}]

اللغة

English

المصدر والدورية

اسم المصدر

Priority-Based Scheduling and Evaluation of Precedence Graphs with Communication Times

المحتوى والصفحات

عدد الصفحات

0

إشراف وإعداد

الإشراف

حبيب يوسف

الإعداد

عادل محمد عادل المعصراني

الاقتباسات الببليوغرافية