Explain the general structure of a typical process, Operating System

Assignment Help:

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:-

667_l structure of a typical process.png

 

Critical section:-

Consider a system consist of n processes P0 to Pn 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.


Related Discussions:- Explain the general structure of a typical process

Explain about spooling, Q. Explain about Spooling? Acronym for simu...

Q. Explain about Spooling? Acronym for simultaneous peripheral operations on line. Spooling denotes to putting jobs in a buffer, a special area in memory or on a disk where

Paging, what is the use of valid invalid bits in paging

what is the use of valid invalid bits in paging

Networking and distributed systems, Networks and operating systems have a l...

Networks and operating systems have a lot of overlap. In this course, however,we are not going to discuss networking in detail, but rather focus on the networking abstractions prov

How can the index blocks be implemented, How can the index blocks be implem...

How can the index blocks be implemented in the indexed allocation scheme? The index block can be implemented as follows a. Multilevel scheme b. Linked scheme c. Combin

Array-initialization loops using lru replacement algorithm, Q. Consider th...

Q. Consider the two-dimensional array A: int A[][] = new int[100][100]; Whereas A [0][0] is at location 200 in a paged memory system with pages of size 200. A little process

What is belady anomaly, What is Belady's anomaly When plotting on a g...

What is Belady's anomaly When plotting on a graph the page faults versus the number of available frames. We notice that the number of faults for four frames is greater than th

Networking sockets with the use of shared memory, Q. Compare the utilizatio...

Q. Compare the utilization of networking sockets with the use of shared memory as a mechanism for communicating data between processes on a single computer. What are the merits of

What is co-operative process, What is co-operative process? A process i...

What is co-operative process? A process is co-operating if it can influence or be affected by the other processes implementing in the system. Any process that share data with o

Locks - mutexes, Locks (also known as mutexes, short for mutual exclusion l...

Locks (also known as mutexes, short for mutual exclusion locks) provide mutual exclusion to shared data inside a critical session. They are implemented by means of two atomic routi

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