On mapping and scheduling tasks with synchronization on clusters of machines

Bassel R. Arafeh*

*المؤلف المقابل لهذا العمل

نتاج البحث: المساهمة في مجلةArticleمراجعة النظراء

ملخص

In this work, a two-step approach is adopted for scheduling tasks with synchronous communication. To that end, an efficient algorithm, called GLB-Synch, is introduced for mapping clusters and ordering tasks on processors in one integrated step. The algorithm used the information obtained during the clustering step for selecting a cluster to be mapped on the least loaded processor. A performance study has been conducted on the GLB-Synch algorithm by simulation. We have shown by analysis and experimentation that the GLB-Sync algorithm retains the same low complexity cost of the first step for clustering.

اللغة الأصليةEnglish
الصفحات (من إلى)254-258
عدد الصفحات5
دوريةLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
مستوى الصوت3033
حالة النشرPublished - 2004

ASJC Scopus subject areas

  • ???subjectarea.asjc.1300.1300???
  • ???subjectarea.asjc.1700.1700???
  • ???subjectarea.asjc.2600.2614???

بصمة

أدرس بدقة موضوعات البحث “On mapping and scheduling tasks with synchronization on clusters of machines'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا