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 language | English |
|---|---|
| Title of host publication | Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 875-882 |
| Number of pages | 8 |
| ISBN (Electronic) | 0769509908, 9780769509907 |
| DOIs | |
| State | Published - 2001 |
Publication series
| Name | Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001 |
|---|
Bibliographical note
Publisher Copyright:© 2001 IEEE.
ASJC Scopus subject areas
- Hardware and Architecture
- Computer Networks and Communications
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver