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?

Cai, What is CAI? Explain its pitfalls.

What is CAI? Explain its pitfalls.

Database, Q1: ER modelling & logical design. An information system is requi...

Q1: ER modelling & logical design. An information system is required for an online auction site, based on the following speci?cation: Only registered users can use the site. Privat

Define levels of abstraction in a dbms, Define Levels of Abstraction in a D...

Define Levels of Abstraction in a DBMS, explain briefly, Conceptual Schema, Physical Schema, External Schema

Binary codes, Binary Codes: We have seen earlier that digital computer...

Binary Codes: We have seen earlier that digital computers use signals that have two distinct values and there exists a direct analogy between binary signals and binary digits.

Machine Learning, Hi I have a 8 question machine learning problem sheet due...

Hi I have a 8 question machine learning problem sheet due to the 25th of december. The exercises require knowledge of basic classifiers, logistic regression, naive bayes, mixture o

Pipelining, tellme the types of pipelining

tellme the types of pipelining

Soft computing, Defination of Propositionl logic Predicate logic genertic a...

Defination of Propositionl logic Predicate logic genertic algorithm Hybrid system Optimization Fuzzy system rules Fuzzy system application

Where data could be hidden, QUESTION (a) Being just employed as junior ...

QUESTION (a) Being just employed as junior forensic examiner at SAI computer forensic Ltd, your supervisor told you, ‘hey Moona Tambi, we have received a hard disk for examinat

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

Theory of computation, I define a restricted form of TMs M as follows. Give...

I define a restricted form of TMs M as follows. Given any input x on the tape of M, the initial portion of the tape that holds x is read-only and one-way. That is, M cannot write o

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