Explain process scheduling in time sharing, Operating System

Assignment Help:

Explain process scheduling in time sharing

The relevant features of time sharing are:

1.      Process priorities do not depend on the nature of the processes

2.      Processes are scheduled in  the Round Robin manner

3.      A running process is pre-empt when its time slice elapses

4.      Processes perhaps swapped out of memory

 

927_process scheduling in time sharing.png

 

A repercussion of the round robin scheduling is that the priority of a process changes dynamically during its life time. It is the uppermost priority process when it is scheduled. It becomes the lowest priority process while it finishes its time slice or when it is blocked because of an IO request. Its efficient priority increases with time as it waits for the CPU

The action of the time sharing scheduler perhaps summarized as follows:

1.      The scheduler maintains 2 different PCB lists- one for ready processes and another for blocked and swapped out processes

2.      The PCB list for ready processes is prepared as a queue

3.      The PCB of a newly created process is able to be added to the end of the ready queue

4.      The PCB of a terminating process is able to be simply removed from the system

5.      The scheduler always selects the PCB on the head of the ready queue

6.      When a running process complete its time slice or makes an IO request its PCB is removed from the ready queue to the blocked/swapped-out list

7.      When the IO operation anticipated by a process finishes its PCB is moved from the blocked/swapped out list to the end of the ready queue


Related Discussions:- Explain process scheduling in time sharing

Explain external fragmentation?, Explain external fragmentation? Extern...

Explain external fragmentation? External fragmentation is the process where the free space and the space still available for use, in a piece of storage become separated into ma

What is internal fragmentation?, What is internal fragmentation? Consid...

What is internal fragmentation? Consider holes of 20k assume the process requests 18 bites. If we allocate accurately the request block, we are left with a hole of 2k. The over

Networking protocols, Modern networks are not implemented as a single piece...

Modern networks are not implemented as a single piece of software; that would render the task of dealing with multiple technologies and manufacturers virtually impossible. The solu

Can a direct access file be read sequentially, Can a direct access file be ...

Can a direct access file be read sequentially? Explain. Yes. Keep a counter, cp, initially set to 0. After reading record cp, increment cp.

Quick, why we say " OS is a resource allocator" and “OS is a control progr...

why we say " OS is a resource allocator" and “OS is a control program"?

What is turnaround time, What is turnaround time? Turnaround time is th...

What is turnaround time? Turnaround time is the interval from the time of submission to the time of completion of a process. It is the sum of the periods exhausted waiting to g

Evicting pages from physical memory, When do we write a page from physical ...

When do we write a page from physical memory back to the disk? In general, caches have two broad types of writing policies. One approach is a write-through cache. In this case,

What is belady anomaly, What is Belady's anomaly When plotting on a g...

What is Belady's anomaly When plotting on a graph the page faults versus the number of available frames. We notice that the number of faults for four frames is greater than th

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd