### Abstract

Scheduling divisible loads in a single-level tree network/system with processors having finite buffer size is addressed. In earlier studies in divisible load scheduling the processors are assumed to have no buffer constraints or have infinite buffer capacity. Hence, the processing time and the load fractions assigned to the processors in the network are obtained by assuming that all the processors will stop computing at the same instant in time. Also in earlier studies, a closed-form expression for the processing time is derived, and using this closed-form expression, an optimal sequence of load distribution is obtained. When the processors in the network have finite buffer then this assumption that all the processors stop computing at the same time instant is not valid. So for a network with buffer constraints, there are two important problems: (i) for a given sequence of load distribution, how to obtain the processing time, and the load fractions assigned to the processors, and (ii) for a given network, how to obtain the optimal sequence of load distribution. Here problem (i) of obtaining the processing time and the load fractions assigned to the processors in the network, for a given sequence of load distribution, is not difficult to solve and is modelled as a linear programming problem and its solution is obtained. For a single-level tree network with m child processors there are m ! sequences of load distribution. The optimal sequence of load distribution is the sequence of load distribution, for which the processing time of the entire processing load is a minimum. So, problem (ii) of obtaining the optimal sequence of load distribution is difficult. It is shown in an earlier study that this problem (ii) is NP-Hard. In this paper, genetic algorithm (GA) is used for problem (ii) to obtain the sequence of load distribution. Various issues related to genetic algorithms such as solution representation, selection methods and genetic operators are presented. Numerical results are provided to show the advantages of GA methodology.

Original language | English |
---|---|

Pages (from-to) | 303-321 |

Number of pages | 19 |

Journal | International Journal of Parallel, Emergent and Distributed Systems |

Volume | 21 |

Issue number | 5 |

DOIs | |

Publication status | Published - 2006 Oct 1 |

Externally published | Yes |

### Fingerprint

### Keywords

- Divisible loads
- Genetic algorithms
- Processing time
- Scheduling problems
- Sequencing

### ASJC Scopus subject areas

- Computer Science(all)

### Cite this

*International Journal of Parallel, Emergent and Distributed Systems*,

*21*(5), 303-321. https://doi.org/10.1080/17445760600567842

**Divisible load scheduling in distributed system with buffer constraints : Genetic algorithm and linear programming approach.** / Suresh, S.; Mani, V.; Omkar, S. N.; Kim, Hyong Joong.

Research output: Contribution to journal › Article

*International Journal of Parallel, Emergent and Distributed Systems*, vol. 21, no. 5, pp. 303-321. https://doi.org/10.1080/17445760600567842

}

TY - JOUR

T1 - Divisible load scheduling in distributed system with buffer constraints

T2 - Genetic algorithm and linear programming approach

AU - Suresh, S.

AU - Mani, V.

AU - Omkar, S. N.

AU - Kim, Hyong Joong

PY - 2006/10/1

Y1 - 2006/10/1

N2 - Scheduling divisible loads in a single-level tree network/system with processors having finite buffer size is addressed. In earlier studies in divisible load scheduling the processors are assumed to have no buffer constraints or have infinite buffer capacity. Hence, the processing time and the load fractions assigned to the processors in the network are obtained by assuming that all the processors will stop computing at the same instant in time. Also in earlier studies, a closed-form expression for the processing time is derived, and using this closed-form expression, an optimal sequence of load distribution is obtained. When the processors in the network have finite buffer then this assumption that all the processors stop computing at the same time instant is not valid. So for a network with buffer constraints, there are two important problems: (i) for a given sequence of load distribution, how to obtain the processing time, and the load fractions assigned to the processors, and (ii) for a given network, how to obtain the optimal sequence of load distribution. Here problem (i) of obtaining the processing time and the load fractions assigned to the processors in the network, for a given sequence of load distribution, is not difficult to solve and is modelled as a linear programming problem and its solution is obtained. For a single-level tree network with m child processors there are m ! sequences of load distribution. The optimal sequence of load distribution is the sequence of load distribution, for which the processing time of the entire processing load is a minimum. So, problem (ii) of obtaining the optimal sequence of load distribution is difficult. It is shown in an earlier study that this problem (ii) is NP-Hard. In this paper, genetic algorithm (GA) is used for problem (ii) to obtain the sequence of load distribution. Various issues related to genetic algorithms such as solution representation, selection methods and genetic operators are presented. Numerical results are provided to show the advantages of GA methodology.

AB - Scheduling divisible loads in a single-level tree network/system with processors having finite buffer size is addressed. In earlier studies in divisible load scheduling the processors are assumed to have no buffer constraints or have infinite buffer capacity. Hence, the processing time and the load fractions assigned to the processors in the network are obtained by assuming that all the processors will stop computing at the same instant in time. Also in earlier studies, a closed-form expression for the processing time is derived, and using this closed-form expression, an optimal sequence of load distribution is obtained. When the processors in the network have finite buffer then this assumption that all the processors stop computing at the same time instant is not valid. So for a network with buffer constraints, there are two important problems: (i) for a given sequence of load distribution, how to obtain the processing time, and the load fractions assigned to the processors, and (ii) for a given network, how to obtain the optimal sequence of load distribution. Here problem (i) of obtaining the processing time and the load fractions assigned to the processors in the network, for a given sequence of load distribution, is not difficult to solve and is modelled as a linear programming problem and its solution is obtained. For a single-level tree network with m child processors there are m ! sequences of load distribution. The optimal sequence of load distribution is the sequence of load distribution, for which the processing time of the entire processing load is a minimum. So, problem (ii) of obtaining the optimal sequence of load distribution is difficult. It is shown in an earlier study that this problem (ii) is NP-Hard. In this paper, genetic algorithm (GA) is used for problem (ii) to obtain the sequence of load distribution. Various issues related to genetic algorithms such as solution representation, selection methods and genetic operators are presented. Numerical results are provided to show the advantages of GA methodology.

KW - Divisible loads

KW - Genetic algorithms

KW - Processing time

KW - Scheduling problems

KW - Sequencing

UR - http://www.scopus.com/inward/record.url?scp=33745387620&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745387620&partnerID=8YFLogxK

U2 - 10.1080/17445760600567842

DO - 10.1080/17445760600567842

M3 - Article

AN - SCOPUS:33745387620

VL - 21

SP - 303

EP - 321

JO - International Journal of Parallel, Emergent and Distributed Systems

JF - International Journal of Parallel, Emergent and Distributed Systems

SN - 1744-5760

IS - 5

ER -