Task matching and scheduling in heterogeneous systems using simulated evolution
- 29 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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 functionrequired 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.Keywords
This publication has 7 references indexed in Scilit:
- A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Task scheduling algorithms for heterogeneous processorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Fast and effective task scheduling in heterogeneous systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Task Matching and Scheduling in Heterogeneous Computing Environments Using a Genetic-Algorithm-Based ApproachJournal of Parallel and Distributed Computing, 1997
- Heterogeneous computing: challenges and opportunitiesComputer, 1993
- ESP: a new standard cell placement package using simulated evolutionPublished by Association for Computing Machinery (ACM) ,1987
- A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax CriterionIEEE Transactions on Computers, 1985