Task Scheduling Management for Load Balancing Using Task Grouping Based on Cloud Computing
Keywords:Scheduling, cloud computing, weighted-fair queue, load balancing
Managing task scheduling management in cloud computing is an essential part for the landscape of complex procedure tasks based on various resources in a proficient and scalable path. The aim of this research is to dynamically optimize the aforesaid issue of task scheduling. The task management improvises the imperfection algorithm by pursue on weighted fair queuing model, which is significantly effective compared to the existing method. A task scheduling model has been created to demonstrate the proposed scheduler management. Study shows the improvement in the adaptation of round robin and shortest job first algorithm performing better than the existing algorithm according to the differentiate execution measurements such as, turnaround time, task size and average waiting time. In addition, context switches play an important role in algorithm by sharing between multiple tasks and running task in the scheduler. Altogether, a significant improvement between existing algorithm and proposed studies follows up accordingly to a specific context switching takes place.
A. H. A. Halim and A. I. Hajamydeen, "Cloud Computing Based Task Scheduling Management Using Task Grouping for Balancing," 2019 IEEE 9th International Conference System Engineering Technology (ICSET) 2019, pp. 419-424, doi: 10.1109/ICSEngT.2019.8906508.
Saxena and Chauhan. “Dynamic Optimization Fair Prioritization Task Scheduling in Cloud based Concepts and Implementations”. International Journal of Computer Network and Information Security, 8(2), 2016, pp. 41-48. doi:10.5815/ijcnis.2016.02.05.
Ram and Nagesh. “A Dynamic Optimization for Task Scheduler in Cloud Computing Resource Usage support”. International Journal Scientific Engineering, vol. 02(10), 2013, pp. 1062-1068.
Monika. “A Dynamic Optimization using Task Scheduling in Cloud Environment”. International Journal Engineering Research and Applications (IJERA), vol. 2(3), 2012, pp. 2564–2568.
Shachee. “Double Level Priority based on Optimization for the Task Scheduler in Cloud Computing”. International Journal Computer Application. vol. 62(20), 2013, pp. 0975–8887.
Upendra. “Improvised Max-min Task Scheduler for the Cloud Computing”. International Journal Application Innovation Engineering, vol. 2(4), 2013, pp. 259–264.
Sandeep. “Improved Round Robin Approach using Dynamic Time Quantum to Improving Average Waiting Time”. International Journal Computer Application. vol. 69(14), 2013, pp. 12–16. doi: 10.5120/11909-8007.
Khokhar “Best Time Quantum Round Robin Algorithm”. vol. 03(05), 2017, pp. 213–217.
Yogita. “Dynamically optimized cost-based task scheduling for the Cloud Computing”. International Journal Emerging Trends, vol. 2(3), 2013, pp. 38–42.
Chandrashekhar and Rajnikant. “Priority Based Dynamic Allocation in Cloud Computing”. 2012 International Symposium Cloud Services Computing. doi: 10.1109/ISCOS.2012.14.
V. Vaithiyanathan. “Efficient TPD Scheduling Algorithm Cloud Environment", International Journal Engineering Technology, vol. 5(3), 2013 pp. 2030-2035. doi: 0975-4024.
M. Mustafa. “Improvise Scheduling Task based Task Grouping in Cloud Environment”. International Journal Computer Applications, vol. 93(8), 2014.
Pallab, Biresh, Amarnath, Rahul and Ritik. “Comparative performance analysis of optimization round robin using dynamic time quantum and static time quantum based on Real Time System”. International Journal Engineering Computer Science, vol. 8(12), 2019, pp. 24890-24893. doi: 0.18535/ijecs/v8i12.4399.
Kashish, "latency-aware max-min algorithm for resource allocate in cloud", International Journal of Electrical and Computer Engineering (IJECE), vol. 11, no. 1, 2020 pp. 671-685. Doi: 10.11591/ijece.v11i1.pp671-685.
How to Cite
Copyright (c) 2021 Ahmad Helmi Abdul Halim, Asif Iqbal Hajamydeen
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
- Papers must be submitted on the understanding that they have not been published elsewhere (except in the form of an abstract or as part of a published lecture, review, or thesis) and are not currently under consideration by another journal published by any other publisher.
- It is also the authors responsibility to ensure that the articles emanating from a particular source are submitted with the necessary approval.
- The authors warrant that the paper is original and that he/she is the author of the paper, except for material that is clearly identified as to its original source, with permission notices from the copyright owners where required.
- The authors ensure that all the references carefully and they are accurate in the text as well as in the list of references (and vice versa).
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Attribution-NonCommercial 4.0 International that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
- The journal/publisher is not responsible for subsequent uses of the work. It is the author's responsibility to bring an infringement action if so desired by the author.