A simulated evolution approach to task-matching and scheduling in heterogeneous computing environments
Abstract This paper applies a simulated evolution (SE) approach to the problem of matching and scheduling dependent tasks in a heterogeneous suite of computers interconnected via a high-speed network. The various steps of the SE approach are discussed in details. Goodness functions required by SE ar...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | article |
| منشور في: |
2020
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/268/1/J_Barada_EAAI_September2002.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | Abstract This paper applies a simulated evolution (SE) approach to the problem of matching and scheduling dependent tasks in a heterogeneous suite of computers interconnected via a high-speed network. The various steps of the SE approach are discussed in details. Goodness functions required by SE are designed and explained. 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 representing the application tasks. The performance of SE is compared with a genetic algorithm approach for the same problem with respect to the quality of solutions generated, and timing requirements of the algorithms. r 2003 Elsevier Science Ltd. All rights reserved. Keywords: Scheduling; Optimization; Heuristics; Heterogeneous systems |
|---|