Chapter

Advances in Computer Systems Architecture

Volume 3740 of the series Lecture Notes in Computer Science pp 529-539

A Real Coded Genetic Algorithm for Data Partitioning and Scheduling in Networks with Arbitrary Processor Release Time

  • S. SureshAffiliated withLancaster UniversityDepartment of Aerospace Engineering, Indian Institute of Science
  • , V. ManiAffiliated withLancaster UniversityDepartment of Aerospace Engineering, Indian Institute of Science
  • , S. N. OmkarAffiliated withLancaster UniversityDepartment of Aerospace Engineering, Indian Institute of Science
  • , H. J. KimAffiliated withCarnegie Mellon UniversityDepartment of Control and Instrumentation Engineering, Kangwon National University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.