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:                                 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. Posted Date: 3/1/2013 5:56:58 AM | Location : United States

Ask an Expert

Your posts are moderated

Write your message here..

Related Questions

Loop statement in both the pbo and pai events, Why do we need to code a LOO... Why do we need to code a LOOP statement in both the PBO and PAI events for each table in the screen? We require coding a LOOP statement in both PBO and PAI events for every ta

Explain microcode and VLSI technology, Q. Explain Microcode and VLSI Techno... Q. Explain Microcode and VLSI Technology? It is considered that CU of a computer be assembled using two ways; create micro-program which execute micro-instructions or construct

What is the significance of the memory table ''screen'', What is the signif... What is the significance of the memory table 'SCREEN'? At runtime, attributes for every screen field are stored in the memory table called 'SCREEN'.  We need not declare this

What is the need of interrupt controller, What is the need of interrupt con... What is the need of interrupt controller?  The interrupt controller is employed to expand the interrupt inputs. It can handle the interrupt requests from several devices and pe

Difference between a substructure and an append structure, What is the diff... What is the difference between a Substructure and an Append Structure? In case of a substructure, the reference originates in the table itself, in the form of a statement

Why we need to construct state transition diagram, Why we need to construct... Why we need to construct state transition diagram Basically you need to construct a state transition diagram for each object with important behaviour. You need not construct on

How are the function code handles in flow logic, How are the function code ... How are the function code handles in Flow Logic? When the User selects a function in a transaction, the system copies the function code into a           specially   designated

Queue, A Queue is a FIFO (rst in, rst out) data structure. Given the foll... A Queue is a FIFO (rst in, rst out) data structure. Given the following queue interface: public interface Queue { int size(); // current queue size boolean isEmpty(); //

Illustrate about compact disk rewritable, Q. Illustrate about Compact Disk ... Q. Illustrate about Compact Disk Rewritable? CD-RW optical disk can be repeatedly written and overwritten same as with a magnetic disk. Even though a number of techniques have

Observed speedup and parallel overhead, Observed Speedup Observed speed... Observed Speedup Observed speedup of a system which has been parallelized, is defined as:                             Granularity is one of the easiest and most extensi