Explain process scheduling, Operating System

Assignment Help:

Explain Process scheduling

Process scheduling consists of the subsequent sub-functions:

1.      Scheduling : Selects the process to be implement next on the CPU

2.      Dispatching: Sets up implementation of the selected process on the CPU

3.      Context save: Saves the status of the running process when its implementation is to be suspended

The scheduling function utilizes information from the PCB's and selects a process based on the scheduling policy in force. Dispatching engrosses the setting up of the execution environment of the selected process and loading information from the PSR and register fields of the PSB into the CPU. The context save function carries out housekeeping when a process releases the CPU or is pre-empted. It engrosses saving the PSR and registers in the appropriate fields of the PCB and changing the process state. In practice this function is performed through the interrupt processing module

The same as shown in the following fig, appearance of an event invokes the context save function. The kernel at this instant processes the event which has occurred. This processing may escort to a change of state for some process. The scheduling function is now appeal to select a process for execution on the CPU. The dispatching function arranges the implementation of the selected function on the CPU.

1546_Process scheduling.png


Related Discussions:- Explain process scheduling

Explain about disk scheduling with neat diagram, Explain about disk schedul...

Explain about disk scheduling with neat diagram? FCFS Scheduling SCAN scheduling C-SCAN scheduling SSTF scheduling LOOK Scheduling

What are the various categories of software, What are the various categorie...

What are the various categories of software?  System software Application  software Engineering/Scientific software Embedded software  Web Applications Artificial I

Describe paging technique used in unix systems, Describe paging technique u...

Describe paging technique used in UNIX systems. When a process begin in UNIX, not every its memory pages are read in from the disk at once. In its place, the kernel loads into

Differences between foreground and background, Describe the differences bet...

Describe the differences between foreground and background processing. What advantage does background processing provide? 1. Background processes typically run with little or no

What do you mean by best fit, What do you mean by best fit? Best fit al...

What do you mean by best fit? Best fit allocates the smallest hole that is big sufficient. The entire list has to be searched, until it is sorted by size. This strategy creates

Explain file allocation using i nodes, File allocation using I nodes. T...

File allocation using I nodes. This method is used to decrease the size of the table in the above method. Every file will have an I-node list. Allow a file have 15 pointers a

Explain the procedure for handling the page fault, The procedure for handli...

The procedure for handling the page fault is as follows 1. We check the internal table to verify whether the reference was valid or invalid. 2. If the reference was invalid,

OS is a resource allocator and control program, why we say OS is a resource...

why we say OS is a resource allocator and control program

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