Multi-Criteria Based Algorithm for Scheduling Divisible Load
Divisible load theory has become a popular area of research during the past two decades. Based on divisible load theory the computations and communications can be divided into some arbitrarily independent parts and each part can be processed independently by a processor. Existing divisible load scheduling algorithms do not consider any priority for allocating fraction of load. In some situation the fractions of load must be allocated based on some priorities. In this paper we propose a multi criteria divisible load scheduling algorithm. The proposed model considers several criteria with different priorities for allocating fractions of load to processors. Experimental result indicates the proposed algorithm can handle the priority of processors.
KeywordsDivisible load scheduling Priority Multi criteria AHP
Unable to display preview. Download preview PDF.
This work has been supported by UPM Research University Grant Scheme RUGS 05-01-10-0896RU/F1 and MOHE Fundamental Research Grant Scheme FRGS/1/11/SG/UPM/01/1.
- 1.Saaty, Thomas L. What is the analytic hierarchy process?. Springer Berlin Heidelberg, 1988.Google Scholar
- 2.Saaty, Thomas L. “How to make a decision: the analytic hierarchy process.” European journal of operational research 48(1), 9-26 (1990).Google Scholar
- 3.Saaty, Thomas L. “The Modern Science of Multi criteria Decision Making and Its Practical Applications: The AHP/ANP Approach.” Operations Research (2013).Google Scholar
- 4.Robertazzi, Thomas G., ed. Networks and Grids: Technology and Theory. Springer, 2007.Google Scholar
- 5.Ghanbari, Shamsollah, and Mohamed Othman. “A Priority based Job Scheduling Algorithm in Cloud Computing.” Procedia Engineering 50, 778-785 (2012).Google Scholar
- 6.Li, Ping, Bharadwaj Veeravalli, and Ashraf A. Kassim. “Design and implementation of parallel video encoding strategies using divisible load analysis.” Circuits and Systems for Video Technology, IEEE Transactions on 15(9), 1098-1112 (2005).Google Scholar
- 7.Ko, Kwangil, and Thomas G. Robertazzi. “Equal allocation scheduling for data intensive applications.” Aerospace and Electronic Systems, IEEE Transactions on 40(2), 695-705 (2004).Google Scholar
- 8.Abdullah, Monir, Mohamed Othman, Hamidah Ibrahim, and Shamala Subramaniam. “Optimal workload allocation model for scheduling divisible data grid applications.” Future Generation Computer Systems 26(7), 971-978 (2010).Google Scholar
- 9.Cheng, Yuan-Chieh, and Thomas G. Robertazzi. “Distributed computation with communication delay [distributed intelligent sensor networks].” Aerospace and Electronic Systems, IEEE Transactions on 24(6), 700-712 (1988).Google Scholar
- 10.Robertazzi, Thomas G. “Ten reasons to use divisible load theory.” Computer 36(5), 63-68 (2003).Google Scholar
- 11.Patrick S. Chen, “On Vargas’s Proof of Consistency test for 3 x 3 Comparison Matrices in AHP” Journal of the Operations Research Society of Japan 45, 233-241 (2002).Google Scholar
- 12.Strassen, Volker. “Gaussian elimination is not optimal.” Numerische Mathematik 13(4), 354-356 (1969).Google Scholar
- 13.Drozdowski, Maciej, and Wodzimierz Gazek. “Scheduling divisible loads in a three-dimensional mesh of processors.” Parallel Computing 25(4), 381-404(1999).Google Scholar
- 14.Berliska, J., and Maciej Drozdowski. “Heuristics for multi-round divisible loads scheduling with limited memory.” Parallel Computing 36(4), 199-211 (2010).Google Scholar