Explain about diffrent process state, Operating System

Assignment Help:

Q. Explain about diffrent Process State?

Process State

  • When process executes, it changes its state. Process state is defined as the current activity of the process. Fig belowdisplays the general form of the process state transition diagram. Process state comprises five states. Each process is in one of the states. The states are listed below.

1.  New

2.  Ready

3.  Running

4.  Waiting

5.  Terminated (exist)

1.  New: A process that has just been created.

2. Ready: Ready processes are waiting to have processor allocated to them by the operating system so that they can run.

3.  Running: Process which is currently being executed. A running process possesses all resources required for its execution comprising the processor.

4.  Waiting: A process which can't execute till some event takes place like the completion of an I/O operation. The running process can become suspended by invoking an I/O module.

5.  Terminated: A process that has been released from the pool of executable processes by operating system.

1868_Explain about diffrent Process State.png

Diagram for Process State

  • Whenever processes changes state, the operating system reacts by placing the process PCB in the list that corresponds to its new state. Only one process can be running on any processor at any instant and many processes may be ready and waiting state.

Related Discussions:- Explain about diffrent process state

Explain two level directory, Two Level Directory This kind of structure...

Two Level Directory This kind of structure overcomes the problems of assigning unique names to the files. Thus there need not be any confusion among users. In this kind of s

Software for business management integrated into network, Software for busi...

Software for business management integrated into a social network Project Description: We are seeking top professionals to build software with us that manages the business.

Single-level page tables, As mentioned above, page tables, are lookup table...

As mentioned above, page tables, are lookup tables mapping a process' virtual pages to physical pages in RAM. How would one implement these page tables? The most straightforward

How is memory management done using bit maps?, How is memory management don...

How is memory management done using bit maps? A bit map is here in this we signify the bit value as 0 or 1. 1-hole 0-process In this we are able to represent the proce

Linux, server configure

server configure

Define lru page replacement policy, Define ‘LRU’ page replacement policy ...

Define ‘LRU’ page replacement policy LRU is Least Recently Used page replacement policy.

Explain the concept of mutual exclusion, Question 1: (a) Discuss about...

Question 1: (a) Discuss about the evolution of operating systems from mainframe batch systems to mainframe time sharing systems. (b) Explain your understanding of the "sus

State in a deadlock-avoidance system, Question: In a deadlock, processe...

Question: In a deadlock, processes never finish executing and system resources are tied up, preventing other jobs from starting. Deadlocks can be characterised by a set of cond

Explain lru enhanced second chance algorithm, Enhanced Second chance algori...

Enhanced Second chance algorithm In this a modify bit is as well used. Now if the ordered pair of reference and modify is (0,0) neither recently used nor modified - the best

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