There quantum time change after every execution

There
are several techniques works done on CPU scheduling which worked on throughput,
arrival time and response time. Working on CPU scheduling improved with the
passage of time. The author {Chhugani, 2017 #1} worked on dynamic time quantum
that calculates scheduling parameter of CPU. The result shows that how to
increase the time quantum for few processor due to the threshold value. The
author {Rajput, 2012 #2} proposed an algorithm which based on priority based
algorithm and compares with standard round robin. The fuzzy technique based on
pre priority and execution time and compare with the different algorithm and
shows better results in {Kumari, 2017 #3}. V FJFDRR focused on round robin with
dynamic time slice and compare with the different technique and shows the
better result in {Mohanty, 2012 # 4}. {Mohanty, 2012 #5} proposed a new
technique that calculates fit factor and dynamic time slice. Fit factor based
on the combination of FCFS, SJF, and priority algorithm and show the better
result as compared to the other scheduling algorithm. SJFDRR works on time
quantum and improves the efficiency of round robin. In this paper, there are
user and system priority. User priority has important than system priority and
reduced the context switching in {Gupta, 2016 #6}. Self Adjustment Round Robin
(SARR) solves the problem of dynamic time-quantum that adjust the burst time
according to the running process. The Proposed algorithm can also be
implemented on a large processor and the operating system itself will find out
the optimal time quantum in {Matarneh, 2009 #7}. {Mohanty, 2011 #8} represents
the algorithm which is called priority-based dynamic round robin that
calculates intelligent time slice for individual process and changes the time
slice before each execution. FPRRDQ shows the better result as compared to
other two which is based on both the user priority and quantum time change
after every execution according to priority and burst time in {Srivastav, 2012
#9}. Optimum service time concept for round-robin algorithm works on an optimum
priority of each process and placed in an order of execution according to
calculated priority in {Saxena, 2012 #10}.

FCFS
work on the basis of the FIFO. Each process executed according to its number.
FCFS performs well for smaller values. It shows poor waiting time, turnaround
time for large computation.SJF worked on the basis of shortest CPU burst
length. In which short process enter in execution queue and execute first. SJF
perform best for long processes as compared to FCFS. It is possible that long
process waits in the ready queue for short process that complete its task but
sometimes it behaves like starvation. RR worked in time quantum. RR worked good
for short process and give the result of minimum average time, minimum
turnaround time and minimum throughout. In real time system, the overhead
invokes after each context switching due to context switching increased for
short time quantum. In case of long-time quantum, Process executes within a
single time slice and performs better result. Priority-based algorithm worked
on low and high priority. Sometimes it becomes suffer a major problem called
starvation because low priority did not execute due to high priority.

We Will Write a Custom Essay Specifically
For You For Only $13.90/page!


order now

To
avoid the problem of overhead and starvation, a new technique should be
introduced to resolve this problem and average waiting time, average turnaround
time and average response time should be increased.

x

Hi!
I'm Isaac!

Would you like to get a custom essay? How about receiving a customized one?

Check it out