On mapping and scheduling tasks with synchronization on clusters of machines

Research output: Contribution to journalArticle

Abstract

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)
Volume3033
Publication statusPublished - 2004

    Fingerprint

ASJC Scopus subject areas

  • Biochemistry, Genetics and Molecular Biology(all)
  • Computer Science(all)
  • Theoretical Computer Science

Cite this