An evolutionary approach to load balancing parallel computations
We present a new approach to balancing the workload in a multicomputer. It is based on a genetic algorithm that combines a number of design choices in order to ameliorate the problem of premature convergence. The genetic algorithm is further hybridized by including a hill climbing procedure which si...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | conferenceObject |
| منشور في: |
1991
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/7956 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=633124 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | We present a new approach to balancing the workload in a multicomputer. It is based on a genetic algorithm that combines a number of design choices in order to ameliorate the problem of premature convergence. The genetic algorithm is further hybridized by including a hill climbing procedure which significantly improves the efficiency of the evolution. Moreover, it makes use of problem specific information to evade computational costs and to reinforce favorable aspects of the genetic search. The experimental results show that the hybrid genetic algorithm can find solutions that are very close to the optimum. |
|---|