Explain the general structure of a typical process?

There are basically four main sections through which each of the process has to pass through.The universal algorithm is:-

 

Critical section:-

Consider a system consist of n processes P₀ to P_n every process has a segment of code, called as critical section, in which the process perhaps changing common variables updating a table, writing a file and so on. Therefore critical section is that area of code in which the processors try to access the shared information. Therefore critical section occurs in the area where race condition occurs.      

Entry section:-

Code just previous to the critical section is termed as the entry section. Every processor must request permission to enter into the critical section, the area of code which execute this request is called as the entry section.

Exit section:-

The code segment just subsequent to the critical section is termed as exit section.

Remainder section:-

The code remaining subsequent to the exit section is remainder section.

Posted Date: 6/19/2013 8:10:42 AM | Location : United States

Ask an Expert

Related Discussions:- Explain the general structure of a typical process, Assignment Help, Ask Question on Explain the general structure of a typical process, Get Answer, Expert's Help, Explain the general structure of a typical process Discussions

Write discussion on Explain the general structure of a typical process
Your posts are moderated

Write your message here..

Related Questions

File system, what are disadvantages of using single directory what are disadvantages of using single directory

Replacement algorithm for tlb, Consider the following C program where M, N,... Consider the following C program where M, N, K are predefined constants. Assume int is 4 bytes. Suppose this program is run on a machine with 4KB page size and 32 TLB entries. Init

Define drawback of distributed systems, Define drawback of Distributed syst... Define drawback of Distributed systems Reliability is a drawback of Distributed systems

Define deadlock prevention, Define deadlock prevention. Deadlock preve... Define deadlock prevention. Deadlock prevention is a set of process for ensuring that at least one of the four essential conditions like mutual exclusion, hold and wait, no pr

What are files and explain the access methods for files, What are files and... What are files and explain the access methods for files? File definition Attributes, operations and types Direct access Sequential access with diagram Other access

Linux os, Introduction of linux Introduction of linux

What inference does recovery in distributed systems, Q. Consider a distrib... Q. Consider a distributed system with two sites A and B. Consider whether site A can distinguish among the following: a. B goes down. b. The link between A and B goes down.

Develop the material requirements plan, The following information is availa... The following information is available for three MPS (Master Product Scheduling) items: Product A                            An 80 unit order is to be started in Week 3.

Write in brief on unix file structure, Write in brief on UNIX file structur... Write in brief on UNIX file structure. UNIX considers every file to be a sequence of 8-bit bytes no interpretation of these bits is made by the operating system. This system pr

What are the allocation methods of a disk space, What are the allocation me... What are the allocation methods of a disk space? Methods of allocating disk space which are widely in use are a. Contiguous allocation b. Linked allocation c. Indexed