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

Hashed page table, W hat is hashed page table & method of hashed page tabl...

W hat is hashed page table & method of hashed page table with details

Hashed page table, Hashed page tables A common approach for handling ad...

Hashed page tables A common approach for handling address spaces larger than 32 bits is to use a hashed page table. Every entry in the hash table having a linked list of elemen

Protection scheme in unix, Q. Consider a system that holds 5000 users. Pre...

Q. Consider a system that holds 5000 users. Presume that you want to allow 4990 of these users to be able to access one file. a. How would you denote this protection scheme in

Linux, shell script that accepts two directory names as arguments and delet...

shell script that accepts two directory names as arguments and delete those file in the second directory that are identical to the file in the first

What are placement and replacement algorithms, Placement algorithms :calcu...

Placement algorithms :calculate where in available real-memory to execute a program. Common functions are next-fit, first-fit, and best-fit. Replacement algorithms :are

Explain about deadlocks, Q. Explain about Deadlocks? Deadlocks for (...

Q. Explain about Deadlocks? Deadlocks for (int i = 0; i // first find a thread that can finish for (int j = 0; j if (!finish[j]) { boolean temp = true; for

Write a short note about context switch, Write a short note about context s...

Write a short note about context switch. Switching the CPU to another process needs saving the state of the old process and loading the saved state for the new process. This ta

Describe paging algorithm needs a reference bit, Q. Suppose that you want ...

Q. Suppose that you want to utilize a paging algorithm that requires a reference bit (such as second-chance replacement or working-set model) however the hardware does not provide

Memory Management Problems, Sir i want formulas in Memory management starti...

Sir i want formulas in Memory management starting from paging till the demang paging in a easy manner for solving problems in competitive exams

What is the use of multiprogramming on individual processors, What is the u...

What is the use of multiprogramming on individual processors ? In the usual multiprocessor, which is dealing with independent or coarse-grained synchronization granularity, it i

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