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?

Explain the application interaction protocols, Explain the Application Inte...

Explain the Application Interaction Protocols Application interaction protocols are uniquely defined for each program and are used to logically describe the data being passed b

Objectives and functions of an operating system, Question: a) What is ...

Question: a) What is an Input/Output module and what are the five categories their functions fall into? b) What is an Operating System? Briefly describe the two objectives

Dual mode operation, WHAT ARE THE ADVANTAGES AND DISADVANTAGES OF DUAL MODE...

WHAT ARE THE ADVANTAGES AND DISADVANTAGES OF DUAL MODE OPERATION OF OPERATING SYSTEM>?

What is page fault?, What is page fault? In the computer storage techno...

What is page fault? In the computer storage technology a page fault is an exception which is raised by the memory management unit when a requested page isn't mapped in physical

What the different paging techniques, The different paging techniques are ...

The different paging techniques are 1. Multilevel paging or hierarchical paging method: In definite cases the page table may consist up to 1 million entries. This would be

Describe paging algorithm needs a reference bit, Q. Suppose that you want ...

Q. Suppose that you want to utilize a paging algorithm that requires a reference bit (such as second-chance replacement or working-set model) however the hardware does not provide

Explain about paging, Explain about paging? Answer: Paging is a memory-...

Explain about paging? Answer: Paging is a memory-management scheme that permits the physical-address space of process to be noncontiguous. Paging avoids the considerable proble

What is a path name, What is a path name? A pathname is the path from t...

What is a path name? A pathname is the path from the root by all subdirectories to a specified file. In a two-level directory structure a user name and a file name explain a pa

Lexical substitution during macro expansion, Lexical substitution during ma...

Lexical substitution during macro expansion Lexical substitution is employed to produce an assembly statement from a model statement. A model statement contains 3 types of stri

Garbage collection, The dynamic memory allocator is a layer between the app...

The dynamic memory allocator is a layer between the application and the OS, managing heap objects. When a program requests memory from the allocator (via malloc(), for instance), t

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