CFP last date
20 December 2024
Reseach Article

Improvised Dynamic Round-Robin Scheduling for Optimum Resource Utilization in Cloud Systems

by Suvarna N.A., Rashmi Priya
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 185 - Number 35
Year of Publication: 2023
Authors: Suvarna N.A., Rashmi Priya
10.5120/ijca2023923144

Suvarna N.A., Rashmi Priya . Improvised Dynamic Round-Robin Scheduling for Optimum Resource Utilization in Cloud Systems. International Journal of Computer Applications. 185, 35 ( Sep 2023), 35-43. DOI=10.5120/ijca2023923144

@article{ 10.5120/ijca2023923144,
author = { Suvarna N.A., Rashmi Priya },
title = { Improvised Dynamic Round-Robin Scheduling for Optimum Resource Utilization in Cloud Systems },
journal = { International Journal of Computer Applications },
issue_date = { Sep 2023 },
volume = { 185 },
number = { 35 },
month = { Sep },
year = { 2023 },
issn = { 0975-8887 },
pages = { 35-43 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume185/number35/32918-2023923144/ },
doi = { 10.5120/ijca2023923144 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T01:27:53.028833+05:30
%A Suvarna N.A.
%A Rashmi Priya
%T Improvised Dynamic Round-Robin Scheduling for Optimum Resource Utilization in Cloud Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 185
%N 35
%P 35-43
%D 2023
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Efficient task scheduling, aimed at maximizing resource utilization (such as CPU, memory, and bandwidth) while executing a maximum number of tasks, is crucial in large-scale cloud computing and associated architectures (e.g., Fog/Edge/IoT). These architectures are employed to support new business models and ensure uninterrupted services, even with intermittent connections to cloud servers. Resource optimization plays a vital role in determining the quality of service (QoS) provided to customers. Furthermore, task scheduling for parallel processing is fundamental for comprehending resource utilization, inter-process communication, network latency, load balancing, job migration, and fault tolerance. This research paper endeavours to explore, analyse, design, and implement scheduling algorithms that optimize the utilization of computing resources. The newly developed algorithm exhibits improved performance compared to existing ones. The results are interpreted and substantiated based on various QoS indicators. General terms Algorithms

References
  1. Pandaba Pradhan, Prafulla Ku. Behera, B N B Ray (2016), “Modified Round Robin Algorithm for Resource Allocation in Cloud omputing”, Procedia Computer Science 85, 878 – 890
  2. Saqib Ul Sabha (2018), “ A Novel and Efficient Round Robin Algorithm with Intelligent Time Slice and Shortest Remaining Time First”, Materials Today Proceedings 5, 12009-12015.
  3. Linz Tom. and Bindu V.R. (2021), “Dynamic Task scheduling Based on Burst Time requirement for cloud environment”, International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.5, September.
  4. Sakshi, Chetan Sharma, Shamneesh Sharma, Sandeep Kautish, Shami A. M. Alsallami, E.M. Khalil, Ali Wagdy Mohamed (2022), “A new median-average round Robin scheduling algorithm: An optimal approach for reducing turnaround and waiting time”, Alexandria Engineering Journal 61, 10527–10538.
  5. Abdulaziz A. Alsulami, Qasem Abu Al-Haija, Mohammed I. Thanoon, Qian Mao (2019), “Performance Evaluation of Dynamic Round Robin Algorithms for CPU Scheduling”, DOI: https://doi.org/0.1109/SoutheastCon 42311.2019.9020439
  6. Uferah Shafi, Munam Shah, Abdul Wahid, Kamran Abbasi, Qaisar Javaid, Muhammad Asghar, and Muhammad Haider (2020), “A Novel Amended Dynamic Round Robin Scheduling Algorithm for Timeshared Systems”, The International Arab Journal of Information Technology, Vol. 17, No. 1, January 2020.
  7. Sanaj M S, Dr. Joe Prathap P M, “An Enhanced Round Robin (ERR) algorithm for Effective and Efficient Task Scheduling in cloud Environment”, https://doi.org/10.1109/ ACCTHPA49271.2020.9213198
  8. Shihab Ullah, “Improved Optimum Dynamic Time Slicing Round Robin Algorithm” (2017), 3rd International Conference on Electrical Information and Communication Technology (EICT), 7-9 December 2017, Khulna, Bangladesh.
  9. Rahul Mishra, Gaurav Mitawa, “Improved Round Robin Algorithm for effective Scheduling Process for CPU” (2021), Proceedings of the Third International Conference on Intelligent Communication Technologies and Virtual Mobile Networks (ICICV 2021). IEEE Xplore Part Number: CFP21ONG-ART; 978-0-7381-1183-4.
  10. BING HU, (Senior Member, IEEE), FUJIE FAN, (Student Member, IEEE), KWAN L. YEUNG, (Senior Member, IEEE), AND SUGIH JAMIN (2018), “Highest Rank First: A New Class of Single-iteration Scheduling Algorithms for Input-queued Switches” IEEE Access, DOI: 10.1109/ACCESS.2017
  11. Mohammad Oqail Ahmad and Rafiqul Zaman Khan (2019), “Cloud Computing Modeling and Simulation using CloudSim Environment”, International Journal of Recent Technology and Engineering (IJRTE) ISSN: 2277-3878, Volume-8 Issue-2, July 2019.
  12. Shahbaz Afzal, G. Kavitha (2019), “Load balancing in cloud computing – A hierarchical taxonomical classification”, Journal of Cloud Computing: Advances, Systems and Applications https://doi.org/10.1186/s13677-019-0146.
  13. Komal Mahajan, Ansuyia Makroo and Deepak Dahiya (2013) “Round Robin with Server Affinity: A VM Load Balancing Algorithm for Cloud Based Infrastructure Journal of Information Processing Systems”, DOI: 10.3745/JIPS.2013.9.3.379.
  14. Altaf Hussain, Muhammad Aleem , Muhammad Arshad Islam, Muhammad Azhar Iqbal (2018), “A Rigorous Evaluation of State-of-the-Art Scheduling Algorithms for Cloud Computing”, IEEE Access, DOI: 10.1109/ACCESS.2018.2884480.
  15. Mung Chiang, Fellow, IEEE, and Tao Zhang, Fellow, IEEE (2016), “Fog and IoT: An Overview of Research Opportunities”, IEEE Internet of Things Journal, vol. 3, no. 6, December 2016.
Index Terms

Computer Science
Information Sciences

Keywords

Round-Robin (RR) Burst Time (BT) Time Slice (TS) Shortest Job First (SJF) Average Completion Time (ACT) Average Waiting Time (AWT).