Explain the life cycle of a process, Computer Engineering

Assignment Help:

Explain the life cycle of a process

Each procedure has a life cycle, which consists of execution, creation and termination phases of the procedure.  A method may create several new procedures, which in turn may also generate still new processes, using system calls. In UNIX operating system environment, a new procedure is produced by fork system call. Process creation needs the following four actions:

i) Setting up the process description: Setting up the process description needs the creation of a Process Control Block (PCB). A  Process Control Block contains basic data such as owner, process identification number, process status, explanation of the allocated address space and other completion dependent process specific information needed for procedure management.

ii)   Allocating an address space:  There are only  two ways to allocate address space to processes; allocating separate space to each process or distribution the address space among the created processes.

iii) loading the program into the allocated address space: The executable program file is overloaded into the allocated memory space.

iv)  Passing the process description to the process scheduler:  The process created is then conceded to the process scheduler who distributes the processor to the competing processes.

The process implementation phase is controlled by the process scheduler. Process scheduling may be per process or per thread. The process scheduling involves three concepts: process states, state transition diagram and scheduling policy.

A process may be in one of the following states given below:

  • New: The process is being formed.
  • Running: The process is being implemented on a single or multiple processors.
  • Waiting: The process is to come for some event to occur.
  • Ready: The process is prepared to be implemented if a processor is available.
  • Terminated: The process has completed execution.

At any time a procedure may be in any single of the above said states. As soon as the process is announce into the job line, it goes into equipped state. When the process scheduler transmits the process, its state turn into running. When the process is completely implemented then it is completed and we say that it is in the completed state. However, the process may return to ready state due to some type of interruption or may go to in waiting state because of some I/O activity. When I/O activity is finished it may go to ready state. The state transition diagram shown in figure 3:

                                2250_life cycle of a process.png

The scheduling policy may be both non pre-emptive and pre-emptive. In pre-emptive policy, the process may be distructed. OS had dissimilar scheduling policies. One of the common policies is First In First Out (FIFO) to select the process to be implemented. When the process finished implementation it is terminated by system calls like abort.


Related Discussions:- Explain the life cycle of a process

Explain bernstein conditions for detection of parallelism, Bernstein Condit...

Bernstein Conditions for Detection of Parallelism For execution of a number of instructions or a block of instructions in parallel, it must be made certain that instructions ar

Cache memories - computer architecture, Cache Memories - computer architect...

Cache Memories - computer architecture: Speed of the primary memory is very low in comparison with the speed of processor For well performance, the processor can't spend

Explain recursive descent parsing, Explain Recursive Descent Parsing It...

Explain Recursive Descent Parsing It is a top down parsing with no backtracking. This parsing method uses a set of recursive processes to perform parsing. Most important advant

Write policy of cache memory, Q. Write Policy of cache memory? If conte...

Q. Write Policy of cache memory? If contents of a block in cache are changed then it's essential to write it back to main memory before replacing it. Write policy determines wh

Illustrate about fifth generation electronic computers, Fifth Generation (1...

Fifth Generation (1984-1990) The advancement of the next generation of computer systems is characterized majorly by the acceptance of parallel processing.  Until this time para

Define a macro definition consists of, A macro definition consists of ? ...

A macro definition consists of ? Ans. A macro Definition have: A macro prototype statement, one or various model statements and also Macro pre-processor statements

Addressability of memory - computer architecture, Addressability: Loc...

Addressability: Location-addressable Each alone accessible unit of information in storage is chosen with its numerical memory address. In the modern computers, location-a

Define baud rate, Define baud rate The rate of data transfer in serial...

Define baud rate The rate of data transfer in serial data communication is signified in bps. Bits per second (bps) is the rate of transfer of information bits. Baud is the num

What is polling, What is polling? Polling is a scheme or an algorithm t...

What is polling? Polling is a scheme or an algorithm to recognize the devices interrupting the processor. Polling is employed when multiple devices interrupt the processor by o

Security, We now consider the relation between passwords and key size. For ...

We now consider the relation between passwords and key size. For this purpose consider a cryptosystem where the user enters a key in the form of a password. Assume a password consi

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