Priority-based Divisible Load Scheduling using Analytical Hierarchy Process

Authors

Shamsollah Ghanbari, Laboratory of Computational Science and Mathematical Physics, Institute For Mathematical Research, Universiti Putra Malaysia 43400 UPM Serdang, Selangor D.E., MalaysiaFollow
Mohamed Othman, Laboratory of Computational Science and Mathematical Physics, Institute For Mathematical Research, Universiti Putra Malaysia 43400 UPM Serdang, Selangor D.E., Malaysia\\ Dept of Communication Tech and Network, Faculty of Computer Science and Information Technology, Universiti Putra Malaysia 43400 UPM Serdang, Selangor D.E., MalaysiaFollow
Mohd Rizam Abu Bakar, Laboratory of Computational Science and Mathematical Physics, Institute For Mathematical Research, Universiti Putra Malaysia 43400 UPM Serdang, Selangor D.E., MalaysiaFollow
Wah June Leong, Laboratory of Computational Science and Mathematical Physics, Institute For Mathematical Research, Universiti Putra Malaysia 43400 UPM Serdang, Selangor D.E., MalaysiaFollow

Author Country (or Countries)

Malaysia

Abstract

The divisible load scheduling is a paradigm in the area of distributed computing. The traditional divisible load theory is based on the fact that, the communications and computations are obedient and do not cheat the algorithm. The literature of review shows that the divisible load model fail to achieve its optimal performance, if the processors do not report their true computation rates. The divisible load scheduling with uncertain communication rates has not been considered in the existing research. This problem lead us to propose a priority based divisible load scheduling method. The goal is to decrease the negative effects of communication rate cheating on the total finish time. The proposed method has been examined on several function approximation problems. It is found that the proposed method is extremely more efficient than either of the other methods.

Recommended Citation

Ghanbari, Shamsollah; Othman, Mohamed; Rizam Abu Bakar, Mohd; and June Leong, Wah (2015) "Priority-based Divisible Load Scheduling using Analytical Hierarchy Process," Applied Mathematics & Information Sciences: Vol. 09: Iss. 5, Article 39.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol09/iss5/39