Open Access   Article Go Back

LAHUBMAX –Priority Based Meta Task Scheduling Algorithm in multicloud

BJ. Hubert Shanthan1 , L. Arockiam2

Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-10 , Page no. 650-655, Oct-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i10.650655

Online published on Oct 31, 2018

Copyright © BJ. Hubert Shanthan, L. Arockiam . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: BJ. Hubert Shanthan, L. Arockiam, “LAHUBMAX –Priority Based Meta Task Scheduling Algorithm in multicloud,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.10, pp.650-655, 2018.

MLA Style Citation: BJ. Hubert Shanthan, L. Arockiam "LAHUBMAX –Priority Based Meta Task Scheduling Algorithm in multicloud." International Journal of Computer Sciences and Engineering 6.10 (2018): 650-655.

APA Style Citation: BJ. Hubert Shanthan, L. Arockiam, (2018). LAHUBMAX –Priority Based Meta Task Scheduling Algorithm in multicloud. International Journal of Computer Sciences and Engineering, 6(10), 650-655.

BibTex Style Citation:
@article{Shanthan_2018,
author = {BJ. Hubert Shanthan, L. Arockiam},
title = {LAHUBMAX –Priority Based Meta Task Scheduling Algorithm in multicloud},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {10 2018},
volume = {6},
Issue = {10},
month = {10},
year = {2018},
issn = {2347-2693},
pages = {650-655},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=3077},
doi = {https://doi.org/10.26438/ijcse/v6i10.650655}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i10.650655}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=3077
TI - LAHUBMAX –Priority Based Meta Task Scheduling Algorithm in multicloud
T2 - International Journal of Computer Sciences and Engineering
AU - BJ. Hubert Shanthan, L. Arockiam
PY - 2018
DA - 2018/10/31
PB - IJCSE, Indore, INDIA
SP - 650-655
IS - 10
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
514 385 downloads 300 downloads
  
  
           

Abstract

Cloud Computing plays a obvivious role in the field of web based computing.Multicloud is an advancement of the cloud computing. Multicloud is an environment comprises of more number of cloud service providers available to cater the needs of the heterogenous users. Task scheduling is one of the major issue affects the performance of the multicloud computing systems. This paper is designed to solve task based scheduling problem for the multicloud systems. Priority is one of the key concern to the service consumers. The high prioritized tasks are given due importance and they are executed in the high speed virtual machines. This article proposes a novel priority based independent task based scheduling algorithm for the multicloud environment. Fuzzy rule is used in this algorithm , to select the user prioritized tasks with larger length. Mandomi Inference system to generate a new rule to select and execute tasks. The proposed algorithm is merely emphasized on minimizing the total completion time of the tasks. There are five different categories of user priorities illustrated in this algorithm. The proposed algorithms outperforms the existing max-min algorithm in terms of makespan and cost.

Key-Words / Index Term

max-min , makespan ,Multicloud , Mandomi

References

[1]. Buyya, C. S. Yeo, S. Venugopal, J. Broberg, and I. Brandic, ”Cloud computing and emerging IT platforms: Vision, Hype, and Reality for Delivering computing as the 5th utility”, Future Generation Computer Systems, ACM Volume25,No.6,pp:599-616,2009.
[2]. T Chatterjee, V. K. Ojha, M. Adhikari, S. Banerjee, U. Biswas and V. Snasel (2014), “Design and Implementation of a New Datacenter Broker policy to improve the QoS of a Cloud”, Proceedings of ICBIA 2014, Advances in Intelligent Systems and Computing, vol. 303, pp- 281-290, 2014
[3]. BJ.Hubert Shanthan, L.Arockiam,”Resource Based Load Balanced Min Min Algorithm(RBLMM) for static Meta task Scheduling in Cloud”,International Conference on Advances in computer Science and Technology (IC-ACT’18) – 2018, International Journal of Engineering and Techniques(IJET), Special Issue, pp.1-5, 2018.
[4]. V.A.Jane, B.J.Hubert Shanthan,. A Survey of Algorithms for Scheduling in the Cloud: In a metric Perspective, International Journal of Computer Sciences and Engineering,Vol.6,Special Issue 2, pp.66-70, 2018.
[5]. Botta, A., de Donato, W., Persico, V. and Pescape. A, “Integration of cloud computing and internet of things: a survey. Future Generation Computer Systems, Vol:56, pp.684-700, 2016.
[6]. Sirisha Potluri, Katta Subba Rao, “Quality of Service based Task Scheduling Algorithms in Cloud Computing”, International Journal of Electrical and Computer Engineering (IJECE), Vol. 7, No. 2, pp. 1088-1095, 2017.
[7]. L. Benedict Carvin, BJ. Hubert Shanthan, A. DalvinVinothKumar, Dr.L.Arockiam, “ Role of Scheduling and Load Balancing Algorithms in cloud to improve the Quality of Services”, International Journal of Computer Science, Vol.5,No.1,pp:1454-1462, 2017.
[8]. BJ. Hubert Shanthan, A. DalvinVinothKumar, Er. Karthigai Priya Govindarajan , Dr.L.Arockiam, “ Scheduling for Internet of Things Applications on Cloud: AReview”,Imperial Journal of Inter disciplinaryResearch(IJIR), Vol.1, No.3, pp:1649-1653,2017.
[9]. Jiang, Hui, Jianjun Yi,Shaoli Chen, Xiaomin Zhu,"A multi-objective algorithm for task scheduling and resource allocation in cloud-based disassembly." Journal of Manufacturing Systems, Vol.41, pp:239-255, 2016.
[10]. Wang, G., Wang, Y., Liu, H., Guo, “HSIP: A Novel Task Scheduling Algorithm for Heterogeneous Computing.”, Scientific Programming, pp:1-11, 2016.
[11]. Kamali Gupta , Vijay Katiyar , “Survey of Resource Provisioning Heuristics in Cloud and their Parameters”, International Journal of Computational Intelligence Research, Vol.5,No.13,pp: 1283-1300, 2017.
[12]. B. Rajasekar, S.K. Manigandan, “An Efficient Resource Allocation Strategies in Cloud Computing”, International Journal of Innovative Research in Computer and Communication Engineering, Vol. 3, pp.1239-1244, 2015.
[13]. Kokilavani T, Amalarethinam DD,” Load balanced min-min algorithm for static meta-task scheduling in grid computing”, International Journal of Computer Applications,Vol:20, No:2, :43-49. 2011.
[14]. Gaurang Patel, Rutuvik Mehta , Upenndra Bhoi , “Enhanced Load Balanced Min Min Algorithm for static meta task scheduling in cloud computing “,Elsveir Procedia Computer Science, ICRTC-2015, Vol:57,2015.
[15]. Maheswaran M, Ali S, Siegal HJ, Hensgen D, Freund RF. “Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems”. In Heterogeneous Computing Workshop,.(HCW`99) Proceedings, IEEE, pp. 30-44, 1999.
[16]. Afaf Abd Elkader, "Enhancing the Minimum Average Scheduling Algorithm (MASA) based on Makespan Minimizing" , Artificial Intelligence and Machine Learning Journal, Vo. 17, No. 1, Delaware, USA, pp. 9-13, 2017.
[17]. Braun TD, Siegel HJ, Beck N, Bölöni LL, Maheswaran M, Reuther AI, Robertson JP, Theys MD, Yao B, Hensgen D, Freund RF. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed computing.Vol:61, No.6, pp: 810-37. 2001.
[18]. Thomas A, Krishnalal G, Raj VJ. Credit based scheduling algorithm in cloud computing environment. Procedia Computer Science, Vol :31, No:46, pp: 913-20, 2015.
[19]. Parsa S, Entezari-Maleki R,”RASA: A new task scheduling algorithm in grid environment.”, World Applied sciences journal, Vol:7, pp:152-60, 2009.
[20]. Sharma G, Banga P. “Task aware switcher scheduling for batch mode mapping in computational grid environment”, International Journal of Advanced Research in Computer ScienceandSoftwareEngineering,Vol:3,No:6,pp:1292-1299, 2013.