What is co-operating scheduling?, Operating System

Assignment Help:

What is co-operating scheduling?

CPU scheduling decisions may possibly place under the following four circumstances:

1.      When process switches from the running state to the waiting state

2.      When process switches from running state to the ready state.

3.      When process switches from waiting state to the ready state.

4.      When a process terminates.

When scheduling occurs only under circumstances 1 and 4, we state that the scheduling scheme is cooperative or nonpreemptive. Here formerly the CPU has been allocated to a process the process keeps the CPU until it releases the CPU either terminating or by switching to the waiting state. Cooperative scheduling is the merely method that can be used on certain hardware platform for the reason that it does not require especial hardware needed for preemptive scheduling.

 


Related Discussions:- What is co-operating scheduling?

Thread, Explain thread in details

Explain thread in details

What is meant by file management systems?, What is meant by file management...

What is meant by file management systems? File Management systems are as well referred to as simply a file system .File system is the system that an OS operating system or prog

Write a script in linux to match a data directory, Write a script that uses...

Write a script that uses this idea to print output similar to the following: Files in this directory that match *~ : bash-scripts.html~ chimpanzee~ countdown~ countd

Essential properties of operating system, Essential Properties of Operating...

Essential Properties of Operating System 1. Batch: Jobs with similar needs are batched together and run through the computer as a group by an operator or automatic job sequen

Define the sleep (sec) function, Define the Sleep (sec) Function Sleep ...

Define the Sleep (sec) Function Sleep function suspends execution of this process for sec number of seconds. While this function is used in our example for consistency, other f

Explain quick fit algorithams, QUICK FIT ALGORITHAMS Here we keep apart...

QUICK FIT ALGORITHAMS Here we keep apart lists for holes and processes. Therefore this reduces the searching time for holes Hole list and Process list. If we organize the li

Explain linked allocation, Linked allocation With linked allocation, ev...

Linked allocation With linked allocation, every file is a linked list of disk blocks; the disk blocks might be scattered anywhere on the disk. The directory has a pointer to th

Define the term operating system, Question: a) Define the term ‘Operat...

Question: a) Define the term ‘Operating System' and identify two goals of an operating system. b) What do you understand by Symmetric multiprocessing (SMP) and Asymmetr

What is dispatch latency, What is dispatch latency? The time taken by t...

What is dispatch latency? The time taken by the dispatcher to stop one process and begin another running is known as dispatch latency.

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