Advantages Of CPU Scheduling

1335 Words6 Pages
ADVANCE SCHEDULING ALGOITHM REVIEW - I

Indresh Bhattacharya (16MCA0078) Bhanu Pratap Singh (16MCA0207)

Abstract: CPU scheduling is an important part of multi programming environment. Many algorithms have been proposed over the years for getting the optimal CPU utilization considering the factors of burst time, response time and waiting time of a process.

Some of the main algorithms that have been utilized to get a better performance are RR (Round Robin), SJF (shortest job first), FCFS (first come First Serve), priority Scheduling. All of the processes above have their pros and cons. But RR gives the optimal performance as compared to the others. Yet for real world performances RR isn’t as suitable as it has a great no of
…show more content…
In computer system all processes execute by changing their states to and fro from CPU burst state to I/O burst state. First a process starts execution from CPU burst then to I/O burst then again CPU and so on. Finally the process ends with a CPU burst and the executing process terminates. The basic work of a scheduler is to give the CPU a process while the current process is doing I/O operation. The algorithm discussed in this paper is pre-emptive in nature and mainly focusing on average waiting and average turnaround…show more content…
And shows equal performance as SJF (shortest Job first ) algorithm.

[2] M.V. Panduranaga Rao, K.C. (2009) She has proposed in the paper a new algorithm New Multi Level Feedback Queue which focuses on good response time with interactive tasks while keeping other tasks from starvation.

There are two kinds of system: real hard time and real soft time. Hard time systems are those where all computation must be performed within given time, regardless of operating condition. If the timing constant is not satisfied, it invalidates the system’s correctness. Soft time systems on the other hand are those which does not strictly follow any timing constraint. Thus for hard system their worst case scenario of execution and interaction is known from start. The paper focuses on the study of the available task schedulers in practice like edf
,rm and multilevel queue.

The criteria of the proposed algorithm are to maximum CPU utilization under the response time <= 1 second. Turnaround time is linearly proportional to total execution time to get Maximize
Open Document