Probabilistic Approach to Scheduling Divisible Load on Network of Processors

Journal Title, Volume, Page:

International journal of Sensor Networks and Data Communications 4:2

Year of Publication:

2015

Link:

http://dx.doi.org/10.4172/2090-4886.1000130

Authors:

Manar Arafat

Department of Computer Science, An-Najah National University, Nablus, Palestine

[email protected]

Sameer Bataineh

Faculty of Computer and Information Technology, Jordan University of Science and Technology, Jordan

Issa Khalil

Qatar Foundation, Qatar

Preferred Abstract (Original):

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.

Attachment	Size
probabilistic-approach-to-scheduling-divisible-load-on-network-ofprocessors-2090-4886-1000130.pdf	969.57 KB

An-Najah Staff

Author Information

Probabilistic Approach to Scheduling Divisible Load on Network of Processors