Q. For proper synchronization in distributed systems

View solution

Q. In the token passing approach of distributed systems, processes are organized in a ring structure

View solution

Q. In distributed systems, transaction coordinator

View solution

Q. In case of failure, a new transaction coordinator can be elected by

View solution

Q. In distributed systems, election algorithms assumes that

View solution

Q. According to the ring algorithm, links between processes are

View solution

Q. What are the characteristics of tightly coupled system ?

i) Different clock
ii) Use communication links
iii) Same clock
iv) Distributed systems

View solution

Q. What are the characteristics of mutual exclusion using centralized approach ?

View solution

Q. What are the characteristics of fully distributed approach ?

i) When responses are received from all processes, then process can enter its Critical Section
ii) When process exits its critical section, the process sends reply messages to all its deferred requests.
iii) It requires request,reply and release per critical section entry
iv) One processor as coordinator which handles all requests

View solution

Q. What are the advantages of token(with rings) passing approach ?

i) One processor as coordinator which handles all requests
ii) No starvation if the ring is unidirectional
iii) There are many messages passed per section entered if few users want to get in section
iv) One processor as coordinator which handles all requests
v) Only one message/entry if everyone wants to get in

View solution

Q. What is the characteristics of atomicity ?

View solution

Q. What things are transaction coordinator is responsible for ?

View solution

Q. Single coordinator approach has the following advantages :

View solution

Q. Single coordinator approach has the following disadvantages :

View solution

Q. What are the disadvantages of majority protocol ?

View solution

Q. What are the parts of global unique identifier ?

View solution

Q. Which are the two complementary deadlock-prevention schemes using time stamps ?

View solution