scholarly journals Enhanced Round-Robin Algorithm in the Cloud Computing Environment for Optimal Task Scheduling

Computers ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 63
Author(s):  
Fahd Alhaidari ◽  
Taghreed Zayed Balharith
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Critical Role ◽  
Turnaround Time ◽  
Round Robin ◽  
Computing Systems ◽  
Time Quantum ◽  
Dynamic Time ◽  
High Level ◽  
Level Performance

Recently, there has been significant growth in the popularity of cloud computing systems. One of the main issues in building cloud computing systems is task scheduling. It plays a critical role in achieving high-level performance and outstanding throughput by having the greatest benefit from the resources. Therefore, enhancing task scheduling algorithms will enhance the QoS, thus leading to more sustainability of cloud computing systems. This paper introduces a novel technique called the dynamic round-robin heuristic algorithm (DRRHA) by utilizing the round-robin algorithm and tuning its time quantum in a dynamic manner based on the mean of the time quantum. Moreover, we applied the remaining burst time of the task as a factor to decide the continuity of executing the task during the current round. The experimental results obtained using the CloudSim Plus tool showed that the DRRHA significantly outperformed the competition in terms of the average waiting time, turnaround time, and response time compared with several studied algorithms, including IRRVQ, dynamic time slice round-robin, improved RR, and SRDQ algorithms.

scholarly journals Comparative performance analysis of optimized round robin scheduling(ORR) using dynamic time quantum with round robin scheduling using static time quantum in Real Time System

2019 ◽  
Vol 8 (12) ◽  
pp. 24890-24893
Author(s):  
Pallab Banerjee ◽  
Biresh Kumar ◽  
Amarnath Singh ◽  
Rahul Kumar ◽  
Ritik Kumar
Keyword(s):  
Task Scheduling ◽  
Turnaround Time ◽  
Round Robin ◽  
Comparative Performance ◽  
Real Time System ◽  
Optimum Utilization ◽  
Time Quantum ◽  
Scheduling Method ◽  
Dynamic Time ◽  
Average Turnaround Time

One of major component of operating system is task scheduling for the optimum utilization of the resources. Round Robin had been an effective task scheduling method so far, but it has certain limitations. It uses static time quantum which sometimes leads to starvation.  The proposed Optimised Round Robin is a modified version of the existing Round Robin scheduling which results in better average time and average turnaround time and overall increase in the performance. The comparative analysis is being done that indicates ORR gives improvement in the system performance.

Dynamic Time Quantum for an Efficient Round Robin in Cloud Computing

2019 ◽  
Vol 16 (5) ◽  
pp. 2404-2409 ◽  
Author(s):  
Khaldun I Arif ◽  
Ahmed S Ketab
Keyword(s):  
Cloud Computing ◽  
Round Robin ◽  
Time Quantum ◽  
Dynamic Time

scholarly journals Time Efficient Round Robin Job Scheduling (NARR) in Cloud Computing

2019 ◽  
Vol 9 (1) ◽  
pp. 6912-6917
Keyword(s):  
Cloud Computing ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Quantum Time ◽  
Time Quantum ◽  
Computational Aspects ◽  
The Common ◽  
Dynamic Time ◽  
Number Of Customers

Cloud computing simply means the advancement of distributed computing which takes data processing computational aspects over networks to centralized high-power data centers. It refers to the use of a centralized pool of resources that are distributed on a pay-per-view model to a large number of customers. This requires scheduling algorithms that allow us to define which task processes, among which resources are first allocated for performance. The Round Robin (RR) scheduling algorithm is the common scheduling algorithm used in multitasking and real-time environments. Its performance is largely determined by the amount of time it takes to carry out a specific task assigned by the CPU. If the less time is chosen the context switch is high and the higher time is chosen, the first-come first-server (FCFS) is selected. System's performance thus totally depends on the optimal quantum time to choose from. In this paper, I'm examining a different way of improving the performance of the round robin scheduling algorithm by means of a dynamic time quantum and comparison of different performance.

scholarly journals Performance Evaluation of Hybrid Round Robin Algorithm and Modified Round Robin Algorithm in Cloud Computing

2019 ◽  
Vol 8 (2) ◽  
pp. 5047-5051
Keyword(s):  
Cloud Computing ◽  
Performance Evaluation ◽  
Scheduling Algorithm ◽  
Turnaround Time ◽  
Round Robin ◽  
Cloud Services ◽  
System Efficiency ◽  
Time Quantum ◽  
Average Turnaround Time ◽  
Burst Time

The scheduling Round Robin (RR) is an impartial algorithm that schedules cloud resources by giving static time quantum to all processes. Time quantum selection is very crucial as it determines performance of algorithms. This research paper suggests an approach to improve RR scheduling algorithm in cloud computing by considering the quantum to be equal to burst time of start request, which dynamically vary after each execution of a request. And also, if the remaining burst time of CPU for currently executing process is lesser than time quantum, then the CPU will be allocated again to the executing process for rest of CPU burst time. MatLAb was used to implement the planned algorithm and benchmarked against MRRA available in literature. In comparison with the planned algorithm, Average Turnaround Time (ATAT) and minimal Average Waiting Time (AWT) was recorded. Based on the obtained simulated outcome, the planned algorithm should be preferred over modified round robin algorithm as it significantly improves the system efficiency. Keywords: Cloud Computing, throughput, Cloud Services, Response Time, Turnaround Time.

scholarly journals Scheduling under Open stack – The Current State and Future Enhancements

2019 ◽  
Vol 8 (2) ◽  
pp. 375-382
Keyword(s):  
Cloud Computing ◽  
Open Source ◽  
Task Scheduling ◽  
Computing System ◽  
Important Task ◽  
Shared Resources ◽  
Computing Systems ◽  
Current State ◽  
Cloud Computing System ◽  
Research Findings

Cloud computing is being heavily used for implementing different kinds of applications. Many of the client applications are being migrated to cloud for the reasons of cost and elasticity. Cloud computing is generally implemented on distributing computing wherein the Physical servers are heavily distributed considering both hardware and software, the connectivity among which is established through Internet. The cloud computing systems as such have many physical servers which contain many resources. The resources can be made to be shared among many users who are the tenants to the cloud computing system. The resources can be virtualized so as to provide shared resources to the clients. Scheduling is one of the most important task of a cloud computing system which is concerned with task scheduling, resource scheduling and scheduling Virtual Machin Migration. It is important to understand the issue of scheduling within a cloud computing system more in-depth so that any improvements with reference to scheduling can be investigated and implemented. For carrying in depth research, an OPEN source based cloud computing system is needed. OPEN STACK is one such OPEN source based cloud computing system that can be considered for experimenting the research findings that are related to cloud computing system. In this paper an overview on the way the Scheduling aspect per say has been implemented within OPEN STACK cloud computing system

Sign in / Sign up

Export Citation Format

Share Document