Priority-based Divisible Load Scheduling using Analytical Hierarchy Process

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 co mputation 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 bee n examined on several function approximation problems. It is found that the proposed method is extremely more efficient than either o f the other methods.

[1]  Chih-Ping Chu,et al.  Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment , 2007, IEEE Transactions on Parallel and Distributed Systems.

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

[3]  Thomas G. Robertazzi,et al.  Optimal load sharing for a divisible job on a bus network , 1992 .

[4]  Thomas G. Robertazzi,et al.  Optimal time-varying load sharing for divisible loads , 1998 .

[5]  Debasish Ghose.  A Feedback Strategy for Load Allocation in Workstation Clusters with Unknown Network Resource Capabilities Using the DLT Paradigm , 2002, PDPTA.

[6]  Daniel Grosu,et al.  Ieee Transactions on Parallel and Distributed Systems 1 Strategyproof Mechanisms for Scheduling Divisible Loads in Bus-networked Distributed Systems , 2022 .

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

[8]  Ping Li,et al.  Design and implementation of parallel video encoding strategies using divisible load analysis , 2005, IEEE Transactions on Circuits and Systems for Video Technology.

[9]  Thomas L. Saaty,et al.  How to Make a Decision: The Analytic Hierarchy Process , 1990 .

[10]  Mohamed Othman,et al.  Cost-Based Multi-QoS Job Scheduling Using Divisible Load Theory in Cloud Computing , 2013, ICCS.

[11]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[12]  Valeria V. Krzhizhanovskaya,et al.  The User-Level Scheduling of Divisible Load Parallel Applications With Resource Selection and Adaptive Workload Balancing on the Grid , 2009, IEEE Syst. J..

[13]  Thomas G. Robertazzi.  Divisible Load Modeling for Grids , 2007 .

[14]  Mounir Hamdi,et al.  Parallel Image Processing Applications on a Network of Workstations , 1995, Parallel Comput..

[15]  Bharadwaj Veeravalli,et al.  Design and Performance Analysis of Divisible Load Scheduling Strategies on Arbitrary Graphs , 2004, Cluster Computing.

[16]  Debasish Ghose,et al.  Large matrix-vector products on distributed bus networks with communication delays using the divisible load paradigm: performance analysis and simulation , 2001, Math. Comput. Simul..

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

[18]  Debasish Ghose,et al.  Scheduling Divisible Loads in Parallel and Distributed Systems , 1996 .

[19]  Maciej Drozdowski,et al.  Scheduling divisible loads in a three-dimensional mesh of processors , 1999, Parallel Comput..

[20]  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..

[21]  Hyoung Joong Kim.  A Novel Optimal Load Distribution Algorithm for Divisible Loads , 2004, Cluster Computing.

[22]  Joanna Berlinska,et al.  Heuristics for multi-round divisible loads scheduling with limited memory , 2010, Parallel Comput..

[23]  Hamidah Ibrahim,et al.  Optimal workload allocation model for scheduling divisible data grid applications , 2010, Future Gener. Comput. Syst..

[24]  Jacek Blazewicz,et al.  Scheduling Divisible Jobs on Hypercubes , 1995, Parallel Comput..

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

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

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

[28]  Debasish Ghose,et al.  Adaptive divisible load scheduling strategies for workstation clusters with unknown network resources , 2005, IEEE Transactions on Parallel and Distributed Systems.

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

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

[31]  Peter Chu,et al.  ON VARGAS'S PROOF OF CONSISTENCY TEST FOR 3 × 3 COMPARISON MATRICES IN AHP , 2002 .

[32]  K. Amalakar,et al.  A Priority Based Job Scheduling Algorithm in Cloud Computing , 2015 .

[33]  Jacek Blazewicz,et al.  Divisible task scheduling - Concept and verification , 1999, Parallel Comput..

[34]  Yves Robert,et al.  Scheduling divisible workloads on heterogeneous platforms , 2003, Parallel Comput..

[35]  Mohamed Othman,et al.  Multi-Criteria Based Algorithm for Scheduling Divisible Load , 2013, DaEng.

[36]  Subramaniam Shamala,et al.  New method for scheduling heterogeneous multi-installment systems , 2012, Future Gener. Comput. Syst..