explain CPU scheduling and its objectives?, Basic Computer Science

Assignment Help:
Definition of CPU scheduling:
The assignment of physical processors to processes allows processors to complete work. The process of determining that for which process which processor should be assign this process is called processor scheduling or CPU scheduling.
When one or more than one process is run able, the operating system must choose which one first. The division of the operating system concerned with this decision is called the scheduler, and algorithm it uses is called the scheduling algorithm.

Objectives of scheduling (objectives)
Many objectives must be regarded as in the design of a scheduling discipline. In exacting, a scheduler should consider fairness, efficiency, reaction time, turnaround time, throughput, etc., Some of these objectives depends on the system one is using for instance batch system, cooperative system or real-time system, etc. but there are also some objectives that are desirable in all systems.

General objectives
• Fairness is vital under all circumstances. A scheduler makes sure that each process gets its fair share of the CPU and no process can undergo indefinite postponement. Note that giving equivalent or equivalent time is not fair. Think of security control and payroll at a nuclear plant.
• The scheduler has to assure that system''s policy is enforced. For instance, if the local policy is safety then the safety control processes must be talented to run whenever they want to, even if it means delay in payroll processes.

• Scheduler should remain the system (or in exacting CPU) demanding cent percent of the time when possible. If the CPU and all the Input / Output devices can be kept running all the time, more work obtains done per second than if some components are idle.
• A scheduler should reduce the time batch users must remain for an output.
• A scheduler should exploit the number of jobs processed per component time.
• A scheduler should reduce the response time for interactive user.


A little thought will show that some of these objectives are opposing. It can be shown that any scheduling algorithm that supports some class of jobs hurts another class of jobs.


Related Discussions:- explain CPU scheduling and its objectives?

Design problem, Design Problem 1. Implement a basic file system managed fr...

Design Problem 1. Implement a basic file system managed from within a file. The file system should have the following capabilities: i. List files stored along with their sizes.

Algorithms and flowcharts, write algorithm and draw flowchart to check whet...

write algorithm and draw flowchart to check whether the given number is palindrome or not

Represent the user interface, Question: CarRide.com is the web portal t...

Question: CarRide.com is the web portal to CarRide Ltd; a car rental company that makes full use of technological advances to make sure you enjoy the ride with your rental car.

Flow decomposition technique to list the cycles, QUESTION (a) Consider ...

QUESTION (a) Consider the graph below, use the Flow Decomposition technique to list the cycles and paths produced.                                                (b) Pr

Device drivers, Device Drivers:   Device drivers are shared computer p...

Device Drivers:   Device drivers are shared computer programs that provide an interface between the hardware devices and operating system or other higher level programs.

Compact diskette (cd), Compact Diskette (CD) CD-ROM ...

Compact Diskette (CD) CD-ROM CD-ROM stands for Compact Disk-Read Only Memory. This disk comes with data already stored in it. It can store around 640 MB of

Problem solving using a computer, PROBLEM SOLVING USING A COMPUTER The ...

PROBLEM SOLVING USING A COMPUTER The following steps are required for solving a problem using a computer system:     Problem Definition     Program Planning (Preparati

Explain the concept of a transition graph, Question 1 Define the concept o...

Question 1 Define the concept of equivalence relation. Give atleast two examples of equivalence relation Question 2 Prove that a graph G is connected if and only if it has a

Kids, how do you let kids learn on it

how do you let kids learn on it

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