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

  • S. Suresh
  • V. Mani
  • S. N. Omkar
  • H. J. Kim
Conference paper

DOI: 10.1007/11572961_43

Volume 3740 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Suresh S., Mani V., Omkar S.N., Kim H.J. (2005) A Real Coded Genetic Algorithm for Data Partitioning and Scheduling in Networks with Arbitrary Processor Release Time. In: Srikanthan T., Xue J., Chang CH. (eds) Advances in Computer Systems Architecture. ACSAC 2005. Lecture Notes in Computer Science, vol 3740. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • S. Suresh
    • 1
  • V. Mani
    • 1
  • S. N. Omkar
    • 1
  • H. J. Kim
    • 2
  1. 1.Department of Aerospace EngineeringIndian Institute of ScienceBangaloreIndia
  2. 2.Department of Control and Instrumentation EngineeringKangwon National UniversityChunchonKorea