General discussion


To solve a problem

By falguni_karan ·
I can’t solve a problem. The problem is like that:-

A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?

Can you solve the problem for me ? Please give me the correct answer as well as the explanation i.e. the process to solve that type of problems.

This conversation is currently closed to new comments.

Thread display: Collapse - | Expand +

All Comments

Collapse -

by wcp In reply to To solve a problem

There are a few properties that need to be clarified.

1. Competing - Are the six tapes independent? For example, if process 1 takes one tape, does process 2 have a choice of the remaining five tapes?

2. May need - Does a process need one and sometimes two tapes?

3. Deadlock ? Does this mean a process has no tape available?

4. Process ? How long does a process last and how soon a second (or other) process may start.

Please add a comment to answer the above.

Assuming the tapes are independent, each process may take two tape drives, a dead lock occurs when the next process has no tape available, and a process starts and lasts randomly, the maximum number of processes must be three (Six tapes divided by two tapes per process). With three processes, there will absolutely be a no deadlock. With four or more processes, there will be a deadlock no matter how small the probability may be.

Of course, the answer will be different depending how the above four got defined.

Collapse -

by Ltop In reply to To solve a problem

I just may be a pessamist at heart, but sure sounds like homework to me.

Collapse -

by wlbowers In reply to To solve a problem

Don't ya just hate those pesky word problems.

A plane crashes on the Canada/USA border. Where do you bury the survivors?

Read your book. Ask your professor.


Related Discussions

Related Forums