TY - GEN
T1 - A real coded genetic algorithm for data partitioning and scheduling in networks with arbitrary processor release time
AU - Suresh, S.
AU - Mani, V.
AU - Omkar, S. N.
AU - Kim, H. J.
N1 - Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2005
Y1 - 2005
N2 - The problem of scheduling divisible loads in distributed computing systems, in presence of processor release time is considered. The objective is to find the optimal sequence of load distribution and the optimal load fractions assigned to each processor in the system such that the processing time of the entire processing load is a minimum. This is a difficult combinatorial optimization problem and hence genetic algorithms approach is presented for its solution.
AB - The problem of scheduling divisible loads in distributed computing systems, in presence of processor release time is considered. The objective is to find the optimal sequence of load distribution and the optimal load fractions assigned to each processor in the system such that the processing time of the entire processing load is a minimum. This is a difficult combinatorial optimization problem and hence genetic algorithms approach is presented for its solution.
UR - http://www.scopus.com/inward/record.url?scp=33646508555&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33646508555&partnerID=8YFLogxK
U2 - 10.1007/11572961_43
DO - 10.1007/11572961_43
M3 - Conference contribution
AN - SCOPUS:33646508555
SN - 3540296433
SN - 9783540296430
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 529
EP - 539
BT - Advances in Computer Systems Architecture - 10th Asia-Pacific Conference, ACSAC 2005, Proceedings
T2 - 10th Asia-Pacific Conference on Advances in Computer Systems Architecture, ACSAC 2005
Y2 - 24 October 2005 through 26 October 2005
ER -