A New Genetic Algorithm for Release-Time Aware Divisible-Load Scheduling

Divisible-load scheduling has become an increasingly important subject in the research of information technologies in recent years. It focuses on finding an efficient scheduling strategy for massive computing in parallel and distributed systems so that the make-span of the workload is minimized. Most existing scheduling models assume that all processors are idle at the beginning of workload assignment. However, in the real parallel and distributed environments, many processors may still in busy when a new workload arrived. Processors may have different waiting time from the busy state to the idle, that is, processors have different release time. This paper proposed a release-time aware divisible-load scheduling model with hybrid time constraints and designed an effective global optimization genetic algorithm to solve it. Finally, the experiment results show the efficiency and effectiveness of the proposed algorithm.

[1]  Thomas G. Robertazzi,et al.  Optimal load sharing for a divisible job on a bus network , 1992 .

[2]  Bharadwaj Veeravalli,et al.  On Handling Large-Scale Polynomial Multiplications in Compute Cloud Environments using Divisible Load Paradigm , 2012, IEEE Transactions on Aerospace and Electronic Systems.

[3]  Debasish Ghose,et al.  Distributed Computation with Communication Delays: Asymptotic Performance Analysis , 1994, J. Parallel Distributed Comput..

[4]  Sundaram Suresh,et al.  The effect of start-up delays in scheduling divisible loads on bus networks: An alternate approach , 2003 .

[5]  Debasish Ghose,et al.  Scheduling Divisible Loads in Parallel and Distributed Systems , 1996 .

[6]  Debasish Ghose,et al.  Distributed computation in linear networks: closed-form solutions , 1994 .

[7]  Debasish Ghose,et al.  Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays , 1994, IEEE Trans. Parallel Distributed Syst..

[8]  Thomas G. Robertazzi,et al.  Ultimate performance limits for networks of load sharing processors , 1992 .

[9]  Shang Mingsheng.  Optimal algorithm for scheduling large divisible workload on heterogeneous system , 2008 .

[10]  Bharadwaj Veeravalli,et al.  On the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks , 2000, IEEE Trans. Parallel Distributed Syst..

[11]  Rajkumar Buyya,et al.  Bandwidth‐aware divisible task scheduling for cloud computing , 2014, Softw. Pract. Exp..

[12]  Thomas G. Robertazzi,et al.  Ten Reasons to Use Divisible Load Theory , 2003, Computer.

[13]  Ngai Ming Kwok,et al.  Adaptive Indexed Divisible Load Theory for Wireless Sensor Network Workload Allocation , 2013, Int. J. Distributed Sens. Networks.

[14]  Thomas G. Robertazzi,et al.  An Exhaustive Approach to Release Time Aware Divisible Load Scheduling , 2009, PDPTA.

[15]  C. Chellappan,et al.  Multi-source task scheduling in grid computing environment using linear programming , 2014, Int. J. Comput. Sci. Eng..

[16]  Hyoung Joong Kim,et al.  Optimal load distribution for tree network processors , 1996 .

[17]  Debasish Ghose,et al.  Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems , 2004, Cluster Computing.

[18]  T.G. Robertazzi,et al.  Optimal divisible job load sharing for bus networks , 1996, IEEE Transactions on Aerospace and Electronic Systems.