Deadlocks: The deadlock denotes a situation where a collection of threads remains blocked. It denotes waiting for a condition that will never be true. The progress graph denotes invaluable tool for understanding deadlock. If “P” and “V” operations are been ordered incorrectly, the forbidden regions for two semaphores would overlap. If some execution trajectory reaches deadlock state “d” then no further progress is possible. In this case each thread waits for the other one for a “V” operation that never occurs. The overlapping forbidden regions would induce a set of states called “deadlock region”. The deadlock is inevitable is trajectory touches a state in deadlock region. Once it enters deadlock regions, the trajectories could never leave. Mutex lock ordering rule: A program is deadlock-free if each thread acquires its mutexes in order. It releases them in reverse order and given a total ordering for all mutexes. The mutex should be achieved in order to ensure deadlock free scheme.

Question

Want to see the full answer?

Answer 1

Question

Chapter 12, Problem 12.29HW

Program Plan Intro

Deadlocks:

The deadlock denotes a situation where a collection of threads remains blocked.

It denotes waiting for a condition that will never be true.

The progress graph denotes invaluable tool for understanding deadlock.

If “P” and “V” operations are been ordered incorrectly, the forbidden regions for two semaphores would overlap.

If some execution trajectory reaches deadlock state “d” then no further progress is possible.

In this case each thread waits for the other one for a “V” operation that never occurs.

The overlapping forbidden regions would induce a set of states called “deadlock region”.

The deadlock is inevitable is trajectory touches a state in deadlock region.

Once it enters deadlock regions, the trajectories could never leave.

Mutex lock ordering rule:

A program is deadlock-free if each thread acquires its mutexes in order.

It releases them in reverse order and given a total ordering for all mutexes.

The mutex should be achieved in order to ensure deadlock free scheme.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Activity No. Activity Time (weeks) Immediate Predecessors 1 Requirements collection 3 2 Requirements structuring 4 1 3 Process analysis 3 2 4 Data analysis 3 2 5 Logical design 50 3,4 6 Physical design 5 5 7 Implementation 6 6 c. Using the information from part b, prepare a network diagram. Identify the critical path.

Given the following Extended-BNF grammar of the basic mathematical expressions: Show the derivation steps for the expression: ( 2 + 3 ) * 6 – 20 / ( 3 + 1 ) Draw the parsing tree of this expression. SEE IMAGE

Whentheuserenters!!,themostrecentcommandinthehistoryisexecuted.In the example above, if the user entered the command: Osh> !! The ‘ls -l’ command should be executed and echoed on user’s screen. The command should also be placed in the history buffer as the next command. Whentheuserentersasingle!followedbyanintegerN,theNthcommandin the history is executed. In the example above, if the user entered the command: Osh> ! 3 The ‘ps’ command should be executed and echoed on the user’s screen. The command should also be placed in the history buffer as the next command. Error handling: The program should also manage basic error handling. For example, if there are no commands in the history, entering !! should result in a message “No commands in history.” Also, if there is no command corresponding to the number entered with the single !, the program should output "No such command in history."