Abstract
The prosperity of cloud technology generates expanding numerous real-time applications runs online. Meantime, real time tasks scheduling is an important criteria for cloud service provider to manage its Quality of Service (QoS) because all customer’s wishes gratifying resource allotment in cloud. Cloud Service Provider (CSP) constitute service level agreement with the customers before the provision of resources. Allocating the resource according to the customer need and utilizing the systems efficiently are the major concern of CSP to increase the profit in their business. For this purpose Hungarian optimization technique is used and it is a standard technique which provides load balanced allocation of resources to the task. Still it cannot be used directly for cloud Virtual Machine (VM) allocation, because load balancing will not give better makespan and the standard Hungarian method is not suitable for unbalanced cost matrix. In this paper efficient resource allocation method called Cluster Cost Matrix – Hungarian (CCM-H) algorithm is proposed to optimize the performance. Algorithm consists of two phases. In first phase algorithm calculates the weighted values of tasks and based on the value tasks are clustered to convert the unbalanced cost matrix to balanced cost matrix. In second phase, according to the balanced cost matrix VM allocation is performed using Hungarian optimization technique. The metrics used for the performance analysis are makespan and utilization factor. The proposed CCM-H algorithm is compared with various existing and standard algorithms called First Come First Serve (FCFS), Min–Min based iterative Hungarian, FCFS based iterative algorithm, Max–min based iterative algorithm Laha and Gupta (Comput Ind Eng, 2016), Group based algorithms Lu et al. (IEEE Trans Wirel Commun, 2017) and normal Hungarianalgorithm, with bench mark dataset Braun (2015) and synthetic dataset which is created with random number generation function. Output shows that how the proposed method outperforms all the existing models.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Change history
27 June 2022
This article has been retracted. Please see the Retraction Notice for more detail: https://doi.org/10.1007/s12652-022-04228-7
References
Alharbi FKSAR (2012) Simple scheduling algorithm with load balancing for grid computing. Asian Trans Comput
Amitha B., S A. (2017) Policy for resource allocation in cloud computing. Am J Intell Syst.
Braun FN (2015) https://code.google.com/p/hcsp-chc/source/browse/trunk/AE/ProblemInstances/HCSP/Braun_et_al/u_c_hihi.0?r=93. Accessed 3 June 2015
Centenaro M, Pesce M, Munaretto D, Zanella A, Zorzi M (2014) A comparison between opportunistic and fair resource allocation scheduling for LTE. In: 2014 IEEE 19th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2014. https://doi.org/10.1109/CAMAD.2014.7033242
Demiroz B, Topcuoglu HR (2006) Static task scheduling with a unified objective on time and resource domains. Comput J. https://doi.org/10.1093/comjnl/bxl030
Durao F, Carvalho JFS, Fonseka A, Garcia VC (2014) A systematic review on cloud computing. J Supercomput. https://doi.org/10.1007/s11227-014-1089-x
Gao Y, Guan H, Qi Z, Song T, Huan F, Liu L (2014) Service level agreement based energy-efficient resource management in cloud data centers. Comput Electr Eng. https://doi.org/10.1016/j.compeleceng.2013.11.001
He XS, Sun XH, Von Laszewski G (2003) QoS guided Min–Min heuristic for grid task scheduling. J Comput Sci Technol. https://doi.org/10.1007/BF02948918
Huang D, Yuan Y, Zhang LJ, Zhao KQ (2009) Research on tasks scheduling algorithms for dynamic and uncertain computing grid based on a+bi connection number of SPA. J Softw. https://doi.org/10.4304/jsw.4.10.1102-1109
Kumar N, Saxena S (2015) A preference-based resource allocation in cloud computing systems. Procedia Comput Sci. https://doi.org/10.1016/j.procs.2015.07.375
Laha D, Gupta JND (2016) A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops. Comput Ind Eng. https://doi.org/10.1016/j.cie.2016.06.003
Lee IS (2018) Minimizing total completion time in the assembly scheduling problem. Comput Ind Eng. https://doi.org/10.1016/j.cie.2018.06.001
Li J, Qiu M, Ming Z, Quan G, Qin X, Gu Z (2012) Online optimization for scheduling preemptable tasks on IaaS cloud systems. J Parallel Distr Comput. https://doi.org/10.1016/j.jpdc.2012.02.002
Li J, Qiu M, Niu JW, Chen Y, Ming Z (2010) Adaptive resource allocation for preemptable jobs in cloud systems. In: Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA’10. https://doi.org/10.1109/ISDA.2010.5687294
Lin W, Wang JZ, Liang C, Qi D (2011) A threshold-based dynamic resource allocation scheme for cloud computing. Procedia Eng. https://doi.org/10.1016/j.proeng.2011.11.2568
Lu X, Ni Q, Li W, Zhang H (2017) Dynamic user grouping and joint resource allocation with multi-cell cooperation for uplink virtual MIMO systems. IEEE Trans Wirel Commun. https://doi.org/10.1109/TWC.2017.2689760
Maheswaran M, Ali S, Siegel HJ, Hensgen D, Freund RF (1999) Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. J Parallel Distr Comput. https://doi.org/10.1006/jpdc.1999.1581
Naseri A, Jafari Navimipour N (2019) A new agent-based method for QoS-aware cloud service composition using particle swarm optimization algorithm J. Ambient Intell Humanized Comput. https://doi.org/10.1007/s12652-018-0773-8
Panda SK, Gupta I, Jana PK (2015) Allocation-aware task scheduling for heterogeneous multi-cloud systems. Procedia Comput Sci. https://doi.org/10.1016/j.procs.2015.04.081
Panda SK, Jana PK (2015) Efficient task scheduling algorithms for heterogeneous multi-cloud environment. J Supercomput. https://doi.org/10.1007/s11227-014-1376-6
Panda SK, Jana PK (2017) SLA-based task scheduling algorithms for heterogeneous multi-cloud environment. J Supercomput. https://doi.org/10.1007/s11227-016-1952-z
Panda SK, Jana PK (2018) Normalization-based task scheduling algorithms for heterogeneous multi-cloud environment. Inf Syst Front. https://doi.org/10.1007/s10796-016-9683-5
Parikh K, Hawanna N, R J (2015) Virtual machine allocation policy in cloud computing using cloudsim in java. Int J Grid Distr Comput. https://doi.org/10.14257/ijgdc.2015.8.1.14
Patel RR, Desai TT, Patel SJ (2017) Scheduling of jobs based on Hungarian method in cloud computing. Proc Int Conf Invent Commun Comput Technol ICICCT. https://doi.org/10.1109/ICICCT.2017.7975166
Praveena A (2013) Resource Allocation and storage using hungarian method in mobile cloud computing. Conput Sci.
Praveenchandar J, Tamilarasi A (2020) Dynamic resource allocation with optimized task scheduling and improved power management in cloud computing. J Ambient Intell Humanized Comput. https://doi.org/10.1007/s12652-020-01794-6
Saraswathi AT, Kalaashri YRA, Padmavathi S (2015) Dynamic resource allocation scheme in cloud computing. Procedia Comput Sci. https://doi.org/10.1016/j.procs.2015.03.180
Selvi ST, Valliyammai C, Dhatchayani VN (2014) Resource allocation issues and challenges in cloud computing. In: 2014 International Conference on Recent Trends in Information Technology, ICRTIT 2014. https://doi.org/10.1109/ICRTIT.2014.6996213
Shetty SM, Shetty S (2019) Analysis of load balancing in cloud data centers. J Ambient Intell Humanized Comput. https://doi.org/10.1007/s12652-018-1106-7
Shi JY, Taifi M, Khreishah A (2011) Resource planning for parallel processing in the cloud. In: Proc.—2011 IEEE International Conference on HPCC 2011—2011 IEEE International Workshop on FTDCS 2011 -Workshops of the 2011 Int. Conf. on UIC 2011—Workshops of the 2011 Int. Conf. ATC 2011. https://doi.org/10.1109/HPCC.2011.117
T A, Mehta R (2015) An approach for VM allocation in cloud environment. Int J Comput Appl. https://doi.org/10.5120/ijca2015905679
Verma M, Krishan Kumar EDHM (2017) Comparative analysis of Job Scheduling algorithms : a review. Int J Eng Dev Res.
Wang T, Wei X, Liang T, Fan J (2018) Dynamic tasks scheduling based on weighted bi-graph in Mobile Cloud Computing. Sustain Comput. https://doi.org/10.1016/j.suscom.2018.05.004
Wang SC, Yan KQ, Liao WP, Wang SS (2010) Towards a load balancing in a three-level cloud computing network. In: Proceedings—2010 3rd IEEE International Conference on Computer Science and Information Technology, ICCSIT 2010. https://doi.org/10.1109/ICCSIT.2010.5563889
Wu F, Wu Q, Tan Y (2015) Workflow scheduling in cloud: a survey. J Supercomput. https://doi.org/10.1007/s11227-015-1438-4
Xhafa F, Barolli L, Durresi A (2007a) Batch mode scheduling in grid systems. Int J Web Grid Serv. https://doi.org/10.1504/IJWGS.2007.012635
Xhafa F, Carretero J, Barolli L, Durresi A (2007b) Immediate mode scheduling in grid systems. Int J Web Grid Serv. https://doi.org/10.1504/IJWGS.2007.014075
Yang CT, Cheng HY, Huang KL (2011) A dynamic resource allocation model for virtual machine management on cloud. Commun Comput Inf Sci. https://doi.org/10.1007/978-3-642-27180-9_70
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This article has been retracted. Please see the retraction notice for more detail: https://doi.org/10.1007/s12652-022-04228-7
About this article
Cite this article
Lavanya, M., Santhi, B. RETRACTED ARTICLE: Hungarian optimization technique based efficient resource allocation using clustering unbalanced estimated cost matrix. J Ambient Intell Human Comput 12, 5525–5540 (2021). https://doi.org/10.1007/s12652-020-02063-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12652-020-02063-2