Task Matching and Scheduling in Heterogeneous Systems Using Simulated Evolution

Authors:
Hassan Barada;Sadiq M. Sait;Naved Baig
Affiliations:
-;-;-
Venue:
IPDPS '01 Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2
Year:
2001

Citing 0
Cited 5

Processor Allocation for Tasks that is Robust Against Errors in Computation Time Estimates

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness

The Journal of Supercomputing
Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions

Journal of Parallel and Distributed Computing
A case for on-machine load balancing

Journal of Parallel and Distributed Computing
Characterization of the iterative application of makespan heuristics on non-makespan machines in a heterogeneous parallel and distributed environment

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

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.