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

Define busy waiting and spinlock, Define busy waiting and spinlock. Whe...

Define busy waiting and spinlock. When a process is in its significant section, any other process that tries to enter its critical section must loop continuously in the entry c

What is a buddy system?, What is a buddy system? We are dividing the me...

What is a buddy system? We are dividing the memory as powers of two therefore the division will be 2, 4, 8, 16, 32, 64, 128, 256...i.e. in powers of 2 as well as we are selecti

Kernel, 1. What must a kernel provide for an effective user-level thread im...

1. What must a kernel provide for an effective user-level thread implementation? 2. With respect to the quantum q in a scheduling algorithm, explain and discuss the impact of the

Drawbacks of least-recently used algorithm, The question of fairness, regar...

The question of fairness, regarding page eviction, is a hard one. How do we decide what is fair? Many operating systems use global LRU, where pages from all processes are managed t

The key challenges of distributed systems, Question 1 Explain the followin...

Question 1 Explain the following with respect to Resource Management in Distributed Systems- Task assignment Approach Load - Balancing Approach Load - Sharing Approach

Difference between threads and processes, Difference between threads and pr...

Difference between threads and processes 1. Thread is flow of implementation. Process is group of instruction which is alike to that of a program except which may be stopped an

Multilevel queue scheduling, Explain multilevel queue scheduling and multil...

Explain multilevel queue scheduling and multilevel feedback queue scheduling #Minimum 100 words accepted#

Define the turn-around time of a user job, Define the “turn-around” time of...

Define the “turn-around” time of a user job Turn- around time is total time taken to execute the job.

Interval between time of submission and completion of job, Interval among t...

Interval among the time of submission and completion of the job is known as                    Interval among the time of submission and completion of the job is known as Turn

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