Distributed System

Number of message required in Ricart Agrawala Algorithm is?

• 3(N-1)

• 2(N-1)

• 3vN

• N

Singhal Heuristic Algorithm is a?

• Token based algorithm

• Non- Token based algorithm

• All the above

• None of the Above

Two events are called Concurrent, if

• Time stamps are not equal

• Time stamp are Equal

• Time stamp are related

• None of above

Number of message required in Suzuki Kasami algorithm is

• 3(N-1)

• 2(N-1)

• 0 or N

• 0 or (N-1)

In the low to moderate load the avarage message traffic in Singhal heuristic

• N/2

• N(N-1)/2

• N-1

• N-3

Two events are called Casually Related, if

• Time stamps are not equal

• Time stamp are equal

• Time stamp are related

• None of the Above

In Suzuki Kasmi, When site Si receives a REQUEST(j, n) message, it sets

• RNi [j]:= max(RNi [j], n)

• RNi [j]:= Min(RNi [j], n)

• RNi [j]:= Avg(RNi [j], n)

• None of these

In the Singhal’s Heuristic Algorithm, token maintain ----data structure

• One

• Two

• Three

• Four

The system throughput is (SD is synchronization delay and E is average critical time)

• 1/(SD+E)

• SD/(SD+E)

• E/(SD+E)

• SD+E

The response time is equivalent to

• Synchronization Delay + response time

• 2(Synchronization delay) + Response time

• Synchronization delay+ response time/2

• None of these