Exam 5: Distributed Systems and Synchronization

According to the ring algorithm, links between processes are ____________

Which one of the following is a distributed file system?

What are the parts of a global unique identifier?

In distributed systems, election algorithms assumes that ____________

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

If a process is executing in its critical section ____________

Which one of the following hides the location where in the network the file is stored?

There is no need to establish and terminate a connection through open and close operation in ___________

In a distributed file system, a file is uniquely identified by ___________

In distributed systems, a logical clock is associated with ______________

If timestamps of two events are same, then the events are ____________

What are the characteristics of mutual exclusion using centralized approach?

What things are the transaction coordinator is responsible for?

A process can enter into its critical section ____________

For proper synchronization in distributed systems ____________

In distributed systems, what will the transaction coordinator do?

In a distributed file system, when a file's physical storage location changes ___________

Which of the following advantages follows the single coordinator approach?

In a distributed file system, _______ is mapping between logical and physical objects.

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