Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Yuan-Chieh C, Robertazzi TG (1988) Distributed computation with communication delay. IEEE Trans Aerosp Electron Syst 24(6):700–712
Agrawal R, Jagadish HV (1988) Partitioning techniques for large-grained parallelism. IEEE Trans Comput 37(12):1627–1634
Bharadwaj V, Li X, Ko CC (2000) Efficient partitioning and scheduling of computer vision and image processing data on bus networks using divisible load analysis. Image Vis Comput 18(11):919–938
Korkhov VV, Moscicki JT, Krzhizhanovskaya V (2009) Dynamic workload balancing of parallel applications with user-level scheduling on the Grid. Futur Gener Comput Syst 25(1):28–34
Shi H, Kwok N, Wang W, Chen S (2014) Divisible load theory based active-sleep workload assignment schemes for wireless sensor networks. Int J Distrib Sens Netw, Hindawi Publishing Corporation. https://doi.org/10.1155/2014/929416
Suresh S, Huang H, Kim HJ (2015) Scheduling in compute cloud with multiple data banks using divisible load paradigm. IEEE Trans Aerosp Electron Syst 51(2):1288–1297
Ghanbari S, Othman M, Leong WJ, Bakar MRA (2016) Multi-objective method for divisible load scheduling in multi-level tree network. Futur Gener Comput Syst 54:132–143
Ghanbari S, Othman M (2018) Time cheating in divisible load scheduling: sensitivity analysis, results and open problems. Procedia Comput Sci 125:935–943
Ghanbari S, Othman M (2014) Comprehensive review on divisible load theory: concepts, strategies, and approaches. Hindawi Publishing Corporation, Math Probl Eng. https://doi.org/10.1155/2014/460354
Robertazzi TG (2003) Ten reasons to use divisible load theory. Computer 36(5):63–68
Carroll TE, Grosu D (2012) An incentive-based distributed mechanism for scheduling divisible loads in tree-networks. J Parallel Distrib Comput 72:389–401
Ghanbari S, Othman M, Bakar MRA, Leong WJ (2015) Priority-based divisible load scheduling using analytical hierarchy process. Appl Math Inf Sci 9(5):2541
Saaty TL (1988) What is the analytic hierarchy process. J Math Models Decis Support 48:109–121
Saaty TL (2013) The modern science of multicriteria decision making and its practical applications: the AHP/ANP approach. Oper Res 6(15):1101–1118
Acknowledgments
This research work is partially supported by the Malaysian Ministry of Education under Research Management Center, Universiti Putra Malaysia, Putra Grant with High Impact Factor. Grant no. UPM/700-2/1/GPB/2017/9557900.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Ghanbari, S., Othman, M. (2020). Reducing the Effects of Time Cheating on the Performance of Divisible Load Scheduling Using Analytical Hierarchy Process. In: Ghazali, R., Nawi, N., Deris, M., Abawajy, J. (eds) Recent Advances on Soft Computing and Data Mining. SCDM 2020. Advances in Intelligent Systems and Computing, vol 978. Springer, Cham. https://doi.org/10.1007/978-3-030-36056-6_38
Download citation
DOI: https://doi.org/10.1007/978-3-030-36056-6_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-36055-9
Online ISBN: 978-3-030-36056-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)