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. © Springer-Verlag 2004.
CITATION STYLE
Arafeh, B. R. (2004). On mapping and scheduling tasks with synchronization on clusters of machines. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3033, 254–258. https://doi.org/10.1007/978-3-540-24680-0_46
Mendeley helps you to discover research relevant for your work.