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

Task Scheduling
Synchronization
Scheduling
Clustering
Cluster Analysis
Experimentation
Low Complexity
Efficient Algorithms
Costs
Costs and Cost Analysis
Communication
Simulation

ASJC Scopus subject areas

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

Cite this

@article{470dec58d7b24362ada6a7d4e446d261,
title = "On mapping and scheduling tasks with synchronization on clusters of machines",
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.",
author = "Arafeh, {Bassel R.}",
year = "2004",
language = "English",
volume = "3033",
pages = "254--258",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - On mapping and scheduling tasks with synchronization on clusters of machines

AU - Arafeh, Bassel R.

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=35048900155&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048900155&partnerID=8YFLogxK

M3 - Article

VL - 3033

SP - 254

EP - 258

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -