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

search tree generated by hill-climbing search, Show the search tree genera...

Show the search tree generated by Hill-Climbing search (text figure 4.2, page 122; or Local Search lecture, slide 6) for each of the two heuristics (a) and (b) applied to the follo

System call, how the system call is work?

how the system call is work?

What is scheduler, What is scheduler? A process migrates among the vari...

What is scheduler? A process migrates among the various scheduling queues throughout its life time. The OS must choose processes from these queues in some fashion. This selecti

What do you mean by first fit, What do you mean by first fit? First fit...

What do you mean by first fit? First fit allocates the first hole that is big sufficient .Searching can either start at the starting of the set of holes or where the previous f

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

Multilevel queue scheduling, Explain multilevel queue scheduling and multil...

Explain multilevel queue scheduling and multilevel feedback queue scheduling #Minimum 100 words accepted#

Briefly describe the producer-consumer problem, Question: a) Each proc...

Question: a) Each process is represented in the operating system by a process control block (PCB). The PCB contains many pieces of information associated with a specific proce

What are the two types of fragmentations, Questiion 1 Use Priority Sche...

Questiion 1 Use Priority Scheduling Algorithm to schedule the following processes        Process                 Burst Time             Priority/Time            P1

Naming scheme for servers in an enterprise, Problem: Within a corporate...

Problem: Within a corporate environment, there are usually many servers located across various departments. Naming of servers is often a tedious task. In many circumstances, w

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