Queueing theory study of round robin versus priority dynamic quantum time round robin scheduling algorithms

2015 ◽  
Author(s):  
Maysoon A. Mohammed ◽  
Mazlina AbdulMajid ◽  
Balsam A. Mustafa ◽  
Rana Fareed Ghani
Keyword(s):  
Queueing Theory ◽  
Scheduling Algorithms ◽  
Round Robin ◽  
Quantum Time

A SURVEY OF VARIANTS OF ROUND ROBIN CPU SCHEDULING ALGORITHMS

2021 ◽  
Vol 4 (4) ◽  
pp. 526-546
Author(s):  
Sunday Samuel Olofintuyi ◽  
Temidayo Oluwatosin Omotehinwa ◽  
Joshua Segun Owotogbe
Keyword(s):  
Research Work ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Round Robin ◽  
Reference Source ◽  
The Past ◽  
Research Areas ◽  
Quantum Time ◽  
Cpu Utilization ◽  
Future Work

Quite a number of scheduling algorithms have been implemented in the past, including First Come First Served (FCFS), Shortest Job First (SJF), Priority and Round Robin (RR). However, RR seems better than others because of its impartiality during the usage of its quantum time. Despite this, there is a big challenge with respect to the quantum time to use. This is because when the quantum time is too large, it leads to FCFS, and if the quantum time is too short, it increases the number of switches from the processes. As a result of this, this paper provides a descriptive review of various algorithms that have been implemented in the past 10 years, for various quantum time in order to optimize the performance of CPU utilization. This attempt will open more research areas for researchers, serve as a reference source and articulate various algorithms that have been used in the previous years – and as such, the paper will serve as a guide for future work. This research work further suggests novel hybridization and ensemble of two or more techniques so as to improve CPU performance by decreasing the number of context switch, turnaround time, waiting time and response time and in overall increasing the throughput and CPU utilization.

Utilizing Dynamic Mean Quantum Time Round Robin to Optimize the Shortest Job First Scheduling Algorithm

2020 ◽  
Author(s):  
Aaron Kyle G. Butangen ◽  
Calvin E. Velasco ◽  
Jethro Czar B. Codmos ◽  
Eugene Frank Bayani ◽  
Rey Benjamin Baquirin
Keyword(s):  
Scheduling Algorithm ◽  
Round Robin ◽  
Quantum Time

scholarly journals Priority based round robin (PBRR) CPU scheduling algorithm

2019 ◽  
Vol 9 (1) ◽  
pp. 190
Author(s):  
Sonia Zouaoui ◽  
Lotfi Boussaid ◽  
Abdellatif Mtibaa
Keyword(s):  
Operating System ◽  
Real Time ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Round Robin ◽  
New Approach ◽  
Real Time Operating System ◽  
Cpu Scheduling

<p>This paper introduce a new approach for scheduling algorithms which aim to improve real time operating system CPU performance. This new approach of CPU Scheduling algorithm is based on the combination of round-robin (RR) and Priority based (PB) scheduling algorithms. This solution maintains the advantage of simple round robin scheduling algorithm, which is reducing starvation and integrates the advantage of priority scheduling. The proposed algorithm implements the concept of time quantum and assigning as well priority index to the processes. Existing round robin CPU scheduling algorithm cannot be dedicated to real time operating system due to their large waiting time, large response time, large turnaround time and less throughput. This new algorithm improves all the drawbacks of round robin CPU scheduling algorithm. In addition, this paper presents analysis comparing proposed algorithm with existing round robin scheduling algorithm focusing on average waiting time and average turnaround time.</p>

scholarly journals Analisis Perbandingan Algoritma Static Round-Robin dengan Least-Connection Terhadap Efisiensi Load Balancing pada Load Balancer Haproxy

2019 ◽  
Vol 4 (1) ◽  
pp. 70-75
Author(s):  
Hasta Triangga ◽  
Ilham Faisal ◽  
Imran Lubis
Keyword(s):  
Load Balancing ◽  
Operating Systems ◽  
Web Server ◽  
Scheduling Algorithms ◽  
Round Robin ◽  
Average Throughput ◽  
Total Delay ◽  
Average Percentage ◽  
Cpu Usage ◽  
Load Balancer

In IT networking, load balancing used to share the traffic between backend servers. The idea is to make effective and efficient load sharing. Load balancing uses scheduling algorithms in the process includes Static round-robin and Least-connection algorithm. Haproxy is a load balancer that can be used to perform the load balancing technique and run by Linux operating systems. In this research, Haproxy uses 4 Nginx web server as backend servers. Haproxy act as a reverse proxy which accessed by the client while the backend servers handle HTTP requests. The experiment involves 20 Client PCs that are used to perform HTTP requests simultaneously, using the Static round-robin algorithm and Least-connection on the haproxy load balancer alternately. When using Static round-robin algorithm, the results obtained average percentages of CPU usage successively for 1 minute; 5 minutes; and 15 minutes are; 0.1%; 0.25%; and 1.15% with average throughput produced is 14.74 kbps. Average total delay produced 64.3 kbps. The average total delay and jitter is 181.3 ms and 11.1 ms, respectively. As for the Least-connection algorithm average percentage obtained successively for 1 minute; 5 minutes; and 15 minutes are 0.1%; 0.3%; and 1.25% with the average throughput produced is 14.66 kbps. The average total delay and jitter is 350.3 ms and 24.5 ms, respectively. It means Static round-robin algorithm is more efficient than the algorithms Least-connection because it can produce a greater throughput with less CPU load and less total delay.

scholarly journals Implementation Of Hybrid Scheduler In Hadoop

2018 ◽  
Vol 7 (2.7) ◽  
pp. 868
Author(s):  
B Thirumala Rao ◽  
M Susmitha ◽  
T Swathi ◽  
G Akhil
Keyword(s):  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Round Robin ◽  
Priority Scheduling

The paper focusses on priority based round robin scheduling algorithm for scheduling jobs in Hadoop environment. By Using this Proposed Scheduling Algorithm it reduces the starvation of jobs. And the advantage of priority scheduling is that the process with the highest priority will be executed first. Combining the both strategies of round robin and priority scheduling algorithm a optimized algorithm is to be implemented. Which works more efficiently even after considering all the parameters of scheduling algorithm. This proposed algorithm is also compared with existing round robin and priority scheduling algorithms.  

Demystifying the Placement Policies of the NVIDIA GPU Thread Block Scheduler for Concurrent Kernels

2021 ◽  
Vol 48 (3) ◽  
pp. 81-88
Author(s):  
Guin Gilman ◽  
Samuel S. Ogden ◽  
Tian Guo ◽  
Robert J. Walls
Keyword(s):  
Resource Availability ◽  
Execution Time ◽  
Scheduling Algorithms ◽  
Round Robin ◽  
Performance Degradation ◽  
Thread Block ◽  
Local Resource ◽  
Scheduling Policy ◽  
Nvidia Gpu ◽  
Placement Policies

In this work, we empirically derive the scheduler's behavior under concurrent workloads for NVIDIA's Pascal, Volta, and Turing microarchitectures. In contrast to past studies that suggest the scheduler uses a round-robin policy to assign thread blocks to streaming multiprocessors (SMs), we instead find that the scheduler chooses the next SM based on the SM's local resource availability. We show how this scheduling policy can lead to significant, and seemingly counter-intuitive, performance degradation; for example, a decrease of one thread per block resulted in a 3.58X increase in execution time for one kernel in our experiments. We hope that our work will be useful for improving the accuracy of GPU simulators and aid in the development of novel scheduling algorithms.

Sign in / Sign up

Export Citation Format

Share Document