First time here? Checkout the FAQ!
+2 votes

Assume that you have a semaphore associated with each item on a doubly linked list. 
Using No other synchronization primitive, What is the fewest number of semaphore that you must acquire for any operation (lookup, insert, delete) ?

asked in Operating System by Veteran (21.3k points)  
edited by | 120 views
Have to tried to consider shared and exclusive locks on a DLL ?

I think 3 semaphores are sufficient as 4 pointers are modified in case of DLL.
Answer given is $1$.

Given Solution :

looks right !

They are not asking to prevent deadlock or starvation. I accounted these for this question as it is not given to do that.
Questions asks for min. semaphores such that given $3$ operations can be performed one at a time. right!
In a doubly linked list we have access to a node from $2$ sides. So, If we go from other side we can perform many together.
This is what i was thinking. suppose we are reading from a node 4 and other thread comes and deletes node 3 then, we have to modify 2 pointers . But that can be done, if question says that there is no possibilty of deadlock and multithreading is there .

Since, it is not concerned about these problems, why not lock the complete list.
When complete list in locked using one semaphore, then it may be the case that all operations are performed from the side that performs UP on semaphore.
Not many up operations, if we use mutex then only 1 at a time will take the control.

Please log in or register to answer this question.

Top Users Jan 2017
  1. Debashish Deka

    7906 Points

  2. Habibkhan

    4736 Points

  3. Vijay Thakur

    4474 Points

  4. sudsho

    4318 Points

  5. saurabh rai

    4200 Points

  6. Arjun

    3638 Points

  7. Bikram

    3500 Points

  8. santhoshdevulapally

    3480 Points

  9. GateSet

    3228 Points

  10. Sushant Gokhale

    3116 Points

Monthly Topper: Rs. 500 gift card

18,944 questions
23,897 answers
20,213 users