GATE | GATE-CS-2009 | Question 33

The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows:

void enter_CS(X)
{
    while test-and-set(X) ;
}
void leave_CS(X)
{
   X = 0;
}

In the above solution, X is a memory location associated with the CS and is initialized to 0. Now consider the following statements:
I. The above solution to CS problem is deadlock-free
II. The solution is starvation free.
III. The processes enter CS in FIFO order.
IV More than one process can enter CS at the same time.

Which of the above statements is TRUE?

(A) I only
(B) I and II
(C) II and III
(D) IV only


Answer: (A)

Explanation: The above solution is a simple test-and-set solution that makes sure that deadlock doesn’t occur, but it doesn’t use any queue to avoid starvation or to have FIFO order.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

3


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.