A New Algorithm for Divisible Load Scheduling with Different Processor Available Times

Abstract

AbstractDuring the last decade, the use of parallel and distributed systems has become more common. In these systems, a huge chunk of data or computation is distributed among many systems in order to obtain better performance. Dividing data is one of the challenges in this type of systems. Divisible Load Theory (DLT) is proposed method for scheduling data distribution in parallel or distributed systems. In many researches carried out in this field, it was assumed that all processors are dedicated for grid system but that is not always true in real systems. The limited number of studies which attended to this reality assumed that systems are homogeneous and presented some algorithms or closed-formulas for scheduling jobs in a System with Different Processors Availability Time (SDPAT). In this article, we propose a new algorithm for scheduling jobs in a heterogeneous SDPAT.KeywordsIdle TimeSchedule TaskCommunication TimeMinimum Response TimeDivisible LoadThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.