answersLogoWhite

0


Best Answer

The Critical section problem occurs when the processors are in a Network. For eg consider that 3 processors share same database at a time, if one processor wants to update the database then no other process will get the access to that database. This point is called as critical section. Temporarily the connection between the other 2 system will be dropped.

User Avatar

Wiki User

15y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

11y ago

in an operating system, there may be a segment of code, which will be shared by many processes.but when two processes shares the code and if one updates the code while other reading it,there occurs a conflict.this is called critical section problem

To avoid this problem a lock is created on that block of code which establishes that no new process can access that block until the first process release it after it's usage.

Thus there would be no chance conflict b/w processes while reading that block simultaneously

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is the description of the critical section problem?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is the role of semaphore in critical section problem?

janina


What is Peterson's solution to critical section problem?

ask dr kevin


What is mean by Peterson's solution in OS?

We illustrate a classic software-based solution to the critical section to the critical solution problem known as peterson's solution.


If the neutral axis of a reinforced section is above the critical section what is the section called?

Under Reinforced Section


What is the most critical problem with the 2014 Honda Odyssey?

There is no critical problem with the Honda Odyssey. They are very reliable.


What are the description of the three large division of the library?

Reference section Fiction section Non Fiction section


Peterson algorigthm with n process?

while(1) { // thread i (0 <= i < n) for (j=1 ; j<n ; j++) { flag[i]=j; last[j]=i; for (k=0 ; k<n ; k++) { if (k==i) continue; while (flag[k]>=flag[i] && last[j]==i) { sleep(random()); } } } // critical section ... // end of critical section flag[i]=0; // not critical section ... // end of not critical section }


Which is the world's 1st critical surgery?

Ceserean Section


What is the word that characterizes a critical section of code?

lock


Which section is critical in rear axle?

The wheels and axle


What is a description of the German flag?

A flag with a black section on top, a red section in the middle, and a yellow section on the bottom.


What is distributed mutual exclusion?

distributed Mutual exclusion, in computer science, refers to the problem of ensuring that no two processes or threads (henceforth referred to only as processes) can be in their critical section at the same time. Here, a critical section refers to a period of time when the process accesses a shared resource, such as shared memory. The problem of mutual exclusion was first identified and solved by Edsger W. Dijkstra in his seminal 1965 paper titled: Solution of a problem in concurrent programming control..hope it helps:)