Purchase Solution

Deadlock with three processes and three resources

Not what you're looking for?

Ask Custom Question

We have 3 reusable resources. A,B,C. We have 3 process X,Y,Z, and each one of them uses periodically 2 of these 3 resources.
Proc. X takes A, then B and then uses both A,B and then releases them.
Proc. Y takes B, then C and then uses both B,C and then releases them.
Proc. Z takes C, then A and then uses both C,A and then releases them.

If 2 of the processes run "parallel" can we have deadlock? If yes, describe the scenario.
If 3 of the processes run "parallel", describe a scenario with a deadlock.

Purchase this Solution
Solution Summary

This solution examines the deadlock possibilities in the situation where there are three processes sharing three resources.

Solution Preview

The first question asks if we can get into a deadlock situation with two processes running. There are only three combinations that have two processes running:

XY
XZ
YZ

In the XY case X takes A and then B. Y takes B then C. If X has already taken B by the time that Y wants it then Y will have to wait. ...

Purchase this Solution
Free BrainMass Quizzes
Javscript Basics

Quiz on basics of javascript programming language.

Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

C# variables and classes

This quiz contains questions about C# classes and variables.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

View More Free Quizzes
Related BrainMass Solutions

  • Safe State System

    It can be defined as a permanent blocking of the processes which are either competing for resources or communicating with each other.

  • This post addresses reprocessing and two-phase locking.

    The two-phased locking process is a method that is used "to gain ownership of shared resources without creating the possibility for deadlock" (Uppsala, 2012).

  • Noting Deadlock in a System

    26125 Deadlock in a system is noted. A system has 5 active processes(A-E) and one type of resource, which there are 200 total unites available in the system. the current state of the system is shown in the table below.

  • American Government and the Constitution

    United States has a system of checks and balances where there are three distinct branches of government.

  • Election Algorithm

    To simplify the discussion, we assume a one-to-one correspondence between processes and sites and thus refer to both as processes, The coordinator is always the process with the largest priority number.

  • DB2, SQL Server, MySQL, Oracle, or Sybase

    Fragmentation: Please see http://www.embarcadero.com/resources/tech_papers/managingspace.pdf 2. Replication, please see the attached documents. and also: http://www.nyoug.org/200212baumgartel.pdf 3.

  • Project Management

    This is a balanced PM process integrating both "hard" processes like procurement, time, resources/ cost, and quality. And PM processes like risk, communications, people/human resources, organization, and integrations.

  • Leadership of Staley Wang, Leslie Marks, and Joseph Hadad

    Allocation of resources: Stanley allocated some of his critical resources to the enhancement of his career. He spent time and energy running with his boss and it is expected that this contributed to his success.

  • Multi-User Databases Management

    Pessimistic locking assumes that conflict will occur and so prevents it ahead of time with locks. In general, optimistic locking is preferred for the Internet and for many intranet applications. 3. What is deadlock? How can it be avoided?

View More Related Solutions