Probabilistic Approach to Scheduling Divisible Load on Network of ProcessorsManar Arafat1, Sameer Bataineh2* and Issa Khalil3
- *Corresponding Author:
- Sameer Bataineh
Faculty of Computer and Information Technology
Jordan University of Science and Technology, Jordan
E-mail: [email protected]
Received date: October 28, 2015; Accepted date: November 24, 2015; Published date: November 27, 2015
Citation: Arafat M, Bataineh S, Khalil I (2015) Probabilistic Approach to Scheduling Divisible Load on Network of Processors. Sensor Netw Data Commun 4:130. doi:10.4172/2090-4886.1000130
Copyright: © 2015 Arafat M, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Divisible Load Theory (DLT) is a very efficient tool to schedule arbitrarily divisible load on a set of network processors. Most of previous work using DLT assumes that the processors' speeds and links' speeds are time- invariant. Closed form solution was derived for the system under the assumption that the processors' speed s and the links' speeds stay the same during the task execution time. This assumption is not practical as most of distributed systems used today have an autonomous control. In this paper we consider a distributed system (Grid) where the availability of the processors varies and follows a certain distribution function. A closed form solution for the finish time is derived. The solution considers all system parameters such as links' speed, number of processors, number of resources (sites), and availability of the processors and how much of power they can contribute. The result is shown and it measures the variation of execution time against the availability of processors.