Reducing the Effects of Time Cheating on the Performance of Divisible Load Scheduling Using Analytical Hierarchy Process

The divisible load theory (DLT) is a paradigm in the area of distributed and parallel computing. As a matter of fact, the computations and communications can be divided into some independent part in which each part can be executed separately by a processor. The problem that the processors may cheat the algorithm has examined the divisible load theory. However, the computation rate cheating issue may appear if the processors accomplish their fraction of loads with various rates. According to the literature, if the processors do not report their true computation rates, they can not obtain optimal performance. This paper focuses on this problem. This paper proposes an AHP-based divisible load scheduling method aiming to decrease the impacts of cheating on the efficiency of divisible load scheduling. The experimental results indicate the proposed method considerably reduce the impacts of cheating on the startup time, speedup, and makespan specially when a huge number of processors cheat the algorithm.

[1]  H. V. Jagadish,et al.  Partitioning Techniques for Large-Grained Parallelism , 1988, IEEE Trans. Computers.

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

[3]  Thomas L. Saaty.  What is the analytic hierarchy process , 1988 .

[4]  Daniel Grosu,et al.  An incentive-based distributed mechanism for scheduling divisible loads in tree networks , 2012, J. Parallel Distributed Comput..

[5]  Thomas G. Robertazzi,et al.  Distributed computation with communication delay (distributed intelligent sensor networks) , 1988 .

[6]  Shamsollah Ghanbari,et al.  Comprehensive Review on Divisible Load Theory: Concepts, Strategies, and Approaches , 2014 .

[7]  Valeria V. Krzhizhanovskaya,et al.  Dynamic workload balancing of parallel applications with user-level scheduling on the Grid , 2009, Future Gener. Comput. Syst..

[8]  Mohamed Othman,et al.  Priority-based Divisible Load Scheduling using Analytical Hierarchy Process , 2015 .

[9]  Hao Huang,et al.  Scheduling in compute cloud with multiple data banks using divisible load paradigm , 2015, IEEE Transactions on Aerospace and Electronic Systems.

[10]  Thomas L. Saaty,et al.  The Modern Science of Multicriteria Decision Making and Its Practical Applications: The AHP/ANP Approach , 2013, Oper. Res..

[11]  Bharadwaj Veeravalli,et al.  Efficient partitioning and scheduling of computer vision and image processing data on bus networks using divisible load analysis , 2000, Image Vis. Comput..

[12]  Shamsollah Ghanbari,et al.  Time Cheating in Divisible Load Scheduling: Sensitivity Analysis, Results and Open Problems , 2018 .

[13]  Mohamed Othman,et al.  Multi-objective method for divisible load scheduling in multi-level tree network , 2016, Future Gener. Comput. Syst..

[14]  Shengyong Chen,et al.  Divisible Load Theory Based Active-Sleep Workload Assignment Schemes for Wireless Sensor Networks , 2014, Int. J. Distributed Sens. Networks.