Abstract
We consider the problem of static load balancing with the objective of minimizing the job response times. The jobs that arrive at a central scheduler are allocated to various processors in the system with certain probabilities. This optimization problem is solved using real-coded genetic algorithms. A comparison of this approach with the standard optimization methods are presented.
Original language | English |
---|---|
Pages (from-to) | 269-279 |
Number of pages | 11 |
Journal | Lecture Notes in Computer Science |
Volume | 3483 |
Issue number | IV |
DOIs | |
Publication status | Published - 2005 |
Externally published | Yes |
Event | International Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore Duration: 2005 May 9 → 2005 May 12 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)