Suresha, S and Mani, V and Omkar, SN and Kim, HJ (2005) A real coded genetic algorithm for data partitioning and scheduling in networks with arbitrary processor release time. In: 10th Asia-Pacific Conference on Advances in Computer Systems Architecture, OCT 24-26, 2005, Singapore.
a_real.pdf - Published Version
Restricted to Registered users only
Download (221Kb) | Request a copy
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.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer.|
|Department/Centre:||Division of Mechanical Sciences > Aerospace Engineering (Formerly, Aeronautical Engineering)|
|Date Deposited:||28 Apr 2010 06:28|
|Last Modified:||19 Sep 2010 06:00|
Actions (login required)