Task matching and scheduling in heterogeneous systems using simulated evolution

Barada, S. M. Sait, N. Baig

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

36 Scopus citations

Abstract

This paper describes and analyzes the application of a simulated evolution (SE) approach to the problem of matching and scheduling of coarse-grained tasks in a heterogeneous suite of machines. The various steps of the SE algorithm are first discussed. Goodness function required by SE is designed and explained. Then experimental results applied on various types of workloads are analyzed. Workloads are characterized according to the connectivity, heterogeneity, and communication-to-cost ratio of the task graphs. The performance of SE is also compared with a genetic algorithm (GA) approach for the same problem with respect to the quality of solutions generated, and timing requirements of the algorithms.

Original languageBritish English
Title of host publicationProceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages875-882
Number of pages8
ISBN (Electronic)0769509908, 9780769509907
DOIs
StatePublished - 2001
Event15th International Parallel and Distributed Processing Symposium, IPDPS 2001 - San Francisco, United States
Duration: 23 Apr 200127 Apr 2001

Publication series

NameProceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Conference

Conference15th International Parallel and Distributed Processing Symposium, IPDPS 2001
Country/TerritoryUnited States
CitySan Francisco
Period23/04/0127/04/01

Fingerprint

Dive into the research topics of 'Task matching and scheduling in heterogeneous systems using simulated evolution'. Together they form a unique fingerprint.

Cite this