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

  • Authors:
  • S. Suresh;V. Mani;S. N. Omkar;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 Aerospace Engineering, Indian Institute of Science, Bangalore, India;Department of Control and Instrumentation Engineering, Kangwon National University, Chunchon, Korea

  • Venue:
  • ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.