On mapping and scheduling tasks with synchronization on clusters of machines

Bassel R. Arafeh*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)254-258
Number of pages5
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publication statusPublished - 2004

ASJC Scopus subject areas

  • General Biochemistry,Genetics and Molecular Biology
  • General Computer Science
  • Theoretical Computer Science


Dive into the research topics of 'On mapping and scheduling tasks with synchronization on clusters of machines'. Together they form a unique fingerprint.

Cite this