Requirements to satisfied by the critical section problem, Operating System

Assignment Help:

What are the requirements to be satisfied by the critical section problem?

Following are the necessities to be satisfied by the critical section problem:

a)      Mutual exclusion: If a process is implementing in the critical section, then no other process is able to be executed in the critical section.

 

b)      Progress: If no process is implementing in the critical section and there are processes that wish to enter the critical section, after that only those process that are not executing in the non critical section can participate in the decision of which will enter its critical section next, and this section cannot be postponed indefinitely

 

c)      Bounded waiting: There subsist abound on the number of times that other processes are permitted to enter their critical sections after a process has made a request to enter its critical section and before that request is granted. This bound avoid starvation of any single process.

 


Related Discussions:- Requirements to satisfied by the critical section problem

Why is rotational optimization no longer consequently useful, UNIX systems ...

UNIX systems utilized to use disk-layout optimizations based on the rotation position of disk data however modern implementations including Linux simply optimize for sequential dat

Explaintable management techniques, Discuss in detail Table management Tech...

Discuss in detail Table management Techniques?     An Assembler employs the subsequent tables: OPTAB: Operation Code Table consists of mnemonic operation code and its machi

#title:cs604, Consider a scenario of post mailbox, there are two processes ...

Consider a scenario of post mailbox, there are two processes named sender S and receiver R. Both processes can communicate with each other by name along with message. You need to I

How is memory management done using bit maps?, How is memory management don...

How is memory management done using bit maps? A bit map is here in this we signify the bit value as 0 or 1. 1-hole 0-process In this we are able to represent the proce

What do you mean by best fit, What do you mean by best fit? Best fit al...

What do you mean by best fit? Best fit allocates the smallest hole that is big sufficient. The entire list has to be searched, until it is sorted by size. This strategy creates

Is computers protect the operating system, Q. Some untimely computers prot...

Q. Some untimely computers protected the operating system by placing it in a memory partition that couldn't be modified by either the user job or the operating system itself. Expl

What are the different constituents of a process, Problem: a) Define th...

Problem: a) Define the term ‘process' and what are the different constituents of a process. b) In the three-state process model, what does each of the three states signify?

Briefly discuss on page replacement, Briefly discuss on page replacement? ...

Briefly discuss on page replacement? Page replacement approach is fixed as follows. If no frame is free, we search one that is not presently being used and free it. We can fre

Interval between time of submission and completion of job, Interval among t...

Interval among the time of submission and completion of the job is known as                    Interval among the time of submission and completion of the job is known as Turn

Memory management, with aid of diagram describe 2 types of fixed partition ...

with aid of diagram describe 2 types of fixed partition allocation used in operating system

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