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?

Cpu, what is cpu

what is cpu

Designing issues in a network -transparency, Transparency Users mus...

Transparency Users must be able to access remote resources as though these resources were local. Transparency should as well promote user mobility. Users must be allowed

Define caching, Define caching. A cache is a region of fast memory that...

Define caching. A cache is a region of fast memory that holds copies of data. Access to the cached copy is well-organized than access to the original. Caching and buffering are

How does communication takes place in a distributed system?, How does commu...

How does communication takes place in a distributed system? Distributed systems depend on the networking for their functionality. A network is a communication path among two

What are the different file operations?, What are the different file operat...

What are the different file operations? Create : - Space for the file in the file system update directory table. Write : - file name and data to be written is

Briefly explain process management in windows 2000., Briefly explain proces...

Briefly explain process management in Windows 2000. The Windows 2000 process manager provides for deleting, creating and using threads and processes. It has no knowledge about

Semispace, Semispace works by maintaining two disjoint areas from which mem...

Semispace works by maintaining two disjoint areas from which memory can be allocated. These areas are called the from-space and the to-space. At ?rst, the algorithm allocates memor

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.

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