Real-Coded genetic algorithms for optimal static load balancing in distributed computing system with communication delays

Authors:
V. Mani;S. Suresh;H. J. Kim
Affiliations:
Department of Aerospace Engineering, Indian Institute of Science, Bangalore, India;Department of Aerospace Engineering, Indian Institute of Science, Bangalore, India;Department of Control and Instrumentation Engineering, Kangwon National University, Chunchon, Korea
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2005

Citing 14
Cited 1

Optimal static load balancing in distributed computer systems

Journal of the ACM (JACM)
An Algorithm for Optimal Static Load Balancing in Distributed Computer Systems

IEEE Transactions on Computers
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Load Balancing Problems for Multiclass Jobs in Distributed/Parallel Computer Systems

IEEE Transactions on Computers
Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis

Artificial Intelligence Review
Optimal balancing of I/O requests to disks

Communications of the ACM
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions

SIAM Journal on Optimization
A Decomposition Algorithm for Optimal Static Load Balancing in Tree Hierarchy Network Configurations

IEEE Transactions on Parallel and Distributed Systems
Hybrid crossover operators for real-coded genetic algorithms: an experimental study

Soft Computing - A Fusion of Foundations, Methodologies and Applications
An Application of Bayesian Decision Theory to Decentralized Control of Job Scheduling

IEEE Transactions on Computers
Adaptive Routing Using a Virtual Waiting Time Technique

IEEE Transactions on Software Engineering
Optimal Load Balancing in a Multiple Processor System with Many Job Classes

IEEE Transactions on Software Engineering
No free lunch theorems for optimization

IEEE Transactions on Evolutionary Computation

A real coded genetic algorithm for data partitioning and scheduling in networks with arbitrary processor release time

ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture

Quantified Score

Hi-index	0.00

Visualization

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.