Design and Performance Evaluation of Smart Job First Multilevel Feedback Queue (SJFMLFQ) Scheduling Algorithm With Dynamic Smart Time Quantum

2021 ◽  
pp. 111-126
Author(s):  
Amit Kumar Gupta ◽  
Narendra Singh Yadav ◽  
Dinesh Goyal
Keyword(s):  
Scheduling Algorithm ◽  
Turnaround Time ◽  
Queue Scheduling ◽  
Time Quantum ◽  
First Come First Serve ◽  
Overall Performance ◽  
And Performance ◽  
Ready Queue ◽  
Priority Factor ◽  
Feedback Queue

Multilevel feedback queue scheduling (MLFQ) algorithm is based on the concept of several queues in which a process moves. In earlier scenarios there are three queues defined for scheduling. The two higher level queues are running on Round Robin scheduling and last level queue is running on FCFS (First Come First Serve). A fix time quantum is defined for RR scheduling and scheduling of process depends upon the arrival time in ready queue. Previously a lot of work has been done in MLFQ. In our propose algorithm Smart Job First Multilevel feedback queue (SJFMLFQ) with smart time quantum (STQ), the processes are arranged in ascending order of their CPU execution time and calculate a Smart Priority Factor SPF on which processes are scheduled in queue. The process which has lowest SPF value will schedule first and the process which has highest SF value will schedule last in queue. Then a smart time quantum (STQ) is calculated for each queue. As a result, we found decreasing in turnaround time, average waiting time and increasing throughput as compared to the previous approaches and hence increase in the overall performance.

Design and Performance Evaluation of Smart Job First Multilevel Feedback Queue (SJFMLFQ) Scheduling Algorithm with Dynamic Smart Time Quantum

2017 ◽  
Vol 8 (2) ◽  
pp. 50-64
Author(s):  
Amit Kumar Gupta ◽  
Narendra Singh Yadav ◽  
Dinesh Goyal
Keyword(s):  
Scheduling Algorithm ◽  
Turnaround Time ◽  
Queue Scheduling ◽  
Time Quantum ◽  
First Come First Serve ◽  
Overall Performance ◽  
And Performance ◽  
Ready Queue ◽  
Priority Factor ◽  
Feedback Queue

Multilevel feedback queue scheduling (MLFQ) algorithm is based on the concept of several queues in which a process moves. In earlier scenarios there are three queues defined for scheduling. The two higher level queues are running on Round Robin scheduling and last level queue is running on FCFS (First Come First Serve). A fix time quantum is defined for RR scheduling and scheduling of process depends upon the arrival time in ready queue. Previously a lot of work has been done in MLFQ. In our propose algorithm Smart Job First Multilevel feedback queue (SJFMLFQ) with smart time quantum (STQ), the processes are arranged in ascending order of their CPU execution time and calculate a Smart Priority Factor SPF on which processes are scheduled in queue. The process which has lowest SPF value will schedule first and the process which has highest SF value will schedule last in queue. Then a smart time quantum (STQ) is calculated for each queue. As a result, we found decreasing in turnaround time, average waiting time and increasing throughput as compared to the previous approaches and hence increase in the overall performance.

scholarly journals Dynamic Time Slice Calculation for Round Robin Process Scheduling Using NOC

2015 ◽  
Vol 5 (6) ◽  
pp. 1480
Author(s):  
G Siva Nageswara Rao ◽  
N. Srinivasu ◽  
S.V.N. Srinivasu ◽  
G. Rama Koteswara Rao
Keyword(s):  
Scheduling Algorithm ◽  
Turnaround Time ◽  
Round Robin ◽  
Fine Tuning ◽  
New Method ◽  
Time Slice ◽  
Process Scheduling ◽  
Time Duration ◽  
Dynamic Time ◽  
Ready Queue

<p>Process scheduling means allocating a certain amount of CPU time to each of the user processes.  One of the popular scheduling algorithms is the “Round Robin” algorithm, which allows each and every process to utilize the CPU for short time duration.  Processes which finish executing during the time slice are removed from the ready queue.  Processes which do not complete execution during the specified time slice are removed from the front of the queue, and placed at the rear end of the queue. This paper presents an improvisation to the traditional round robin scheduling algorithm, by proposing a new method. The new method represents the time slice as a function of the burst time of the waiting process in the ready queue. Fixing the time slice for a process is a crucial factor, because it subsequently influences many performance parameters like turnaround time, waiting time, response time and the frequency of context switches.  Though the time slot is fixed for each process, this paper explores the fine-tuning of the time slice for processes which do not complete in the stipulated time allotted to them.</p>

The Messaging Mechanism Based on Multi-Level Feedback Queue Scheduling Algorithm

2013 ◽  
Vol 756-759 ◽  
pp. 1763-1765
Author(s):  
Ting Shun Li ◽  
Jiao Hui Xu ◽  
Hui Yu
Keyword(s):  
Wireless Communication ◽  
Communication Technology ◽  
Scheduling Algorithm ◽  
Communication Tools ◽  
Queue Scheduling ◽  
Multi Level ◽  
Feedback Queue

With the development of wireless communication technology, SMS , as a kind of flexible communication tools, is widely used in the various units. Aimed at large quantities of SMS processing, this paper proposes a new scheduling algorithm based on multi-level feedback queue. Multi-level feedback queue scheduling algorithm can not only make the high priority jobs response, but also make the short operations (process) done quickly.

scholarly journals Designing of Vague Logic Based 2-Layered Framework for CPU Scheduler

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Supriya Raheja
Keyword(s):  
Simulation Analysis ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Optimum Time ◽  
Optimum Length ◽  
Learning Capability ◽  
Inference System ◽  
Time Quantum ◽  
Overall Performance ◽  
Effectiveness And Efficiency

Fuzzy based CPU scheduler has become of great interest by operating system because of its ability to handle imprecise information associated with task. This paper introduces an extension to the fuzzy based round robin scheduler to a Vague Logic Based Round Robin (VBRR) scheduler. VBRR scheduler works on 2-layered framework. At the first layer, scheduler has a vague inference system which has the ability to handle the impreciseness of task using vague logic. At the second layer, Vague Logic Based Round Robin (VBRR) scheduling algorithm works to schedule the tasks. VBRR scheduler has the learning capability based on which scheduler adapts intelligently an optimum length for time quantum. An optimum time quantum reduces the overhead on scheduler by reducing the unnecessary context switches which lead to improve the overall performance of system. The work is simulated using MATLAB and compared with the conventional round robin scheduler and the other two fuzzy based approaches to CPU scheduler. Given simulation analysis and results prove the effectiveness and efficiency of VBRR scheduler.

scholarly journals An Improved Round Robin CPU Scheduling Algorithm based on Priority of Process

2018 ◽  
Vol 7 (4.5) ◽  
pp. 238 ◽  
Author(s):  
Govind Prasad Arya ◽  
Kumar Nilay ◽  
Devendra Prasad
Keyword(s):  
Operating System ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Process Scheduling ◽  
Cpu Scheduling ◽  
Average Waiting Time ◽  
Time Quantum ◽  
First Come First Serve ◽  
Time Changes

The most important and integral part of a computer system is its operating system. Scheduling various resources is one of the most critical tasks an operating system needs to perform. Process scheduling being one of those tasks, involves various techniques that define how more than one processes can be executed simultaneously. The primary aim here is to the system more efficient and faster. The fundamental scheduling algorithms are: First Come First Serve (FCFS), Round Robin, Priority Based Scheduling, and Shortest Job First (SJF). This paper focuses on Round Robin Scheduling algorithm and various issues related to it. One major issue in RR scheduling is determining the length of Time Quantum. If the Time Quantum is too large RR scheduling behaves as FCFS. On the other hand, if it is too small it forces considerable increase in the number of context switches. Our main objective is to overcome this limitation of traditional RR scheduling algorithm and maximize CPU utilization, further, leading to more efficient and faster system. Here we propose an algorithm that categorizes available processes into High Priority processes and Low Priority process. The proposed algorithm reduces the average waiting time of High Priority processes in all cases and of Low Priority processes in not all but some cases. The overall waiting time changes on the basis of set of processes considered. The simulation results justify that the proposed schemes reduces the overall average waiting time when compared to the existing schemes. 

scholarly journals An approach to reduce turn around timeand waiting timeby the selection of round robin and shortest job first algorithm

2018 ◽  
Vol 7 (2.8) ◽  
pp. 667 ◽  
Author(s):  
Sarvesh Kumar ◽  
Gaurav Kumar ◽  
Komal Jain ◽  
Aditi Jain
Keyword(s):  
Operating System ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Turnaround Time ◽  
Round Robin ◽  
Average Amount ◽  
Ready Queue ◽  
Multiple Processing ◽  
Different Levels ◽  
Selection Of

In this research,a study on operating system tells about its working,  how it helps as interface between user software and system  hardware .To implement this, different scheduling is used to provide multiple processing in a hardware. There are different levels of scheduler applied in different levels of process from ready queue to termination. This paper focuses on the average amount of waiting time and amount of turnaround time of processes. The proposed algorithm purely defines less waiting time and turnaround time as compared to the round robin scheduling and shortest job first scheduling algorithm.

scholarly journals Performance analysis of CPU scheduling algorithms – A problem solving approach

2021 ◽  
pp. 411-416
Author(s):  
Thangakumar Jeyaprakash ◽  
Sambath M
Keyword(s):  
Performance Analysis ◽  
Job Scheduling ◽  
Algorithm Design ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Performance Parameters ◽  
Cpu Scheduling ◽  
First Come First Serve ◽  
Ready Queue ◽  
Young Researchers

Scheduling algorithms plays a significant role in optimizing the CPU in operating system. Each scheduling algorithms [8] schedules the processes in the ready queue with its own algorithm design and its properties. In this paper, the performance analysis of First come First serve scheduling, non-pre-emptive scheduling, Pre-emptive scheduling, Shortest Job scheduling First (SJF) and Round Robin algorithm has been discussed with an example and the results has been analysed with the performance parameters such as minimum waiting time, minimum turnaround time and Response time. This will help the young researchers to analyse algorithms to develop a new optimized algorithm for CPU optimization.

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.

Sign in / Sign up

Export Citation Format

Share Document