Exam 18: Distributed Process Management

The __________ algorithm can be used to provide a checkpoint of a distributed algorithm to allow rollback and recovery if a failure is detected.

A __________ records the state of a process and includes a record of all messages sent and received on all channels.

A __________ process transfer involves only processes that have not begun execution and hence do not require transferring the state of the process.

_________ is the permanent blocking of a set of processes that either compete for system resources or communicate with one another.

Algorithms for mutual exclusion and deadlock must depend on access to common memory.

The aim of an algorithm that deals with deadlock is either to prevent the formation of a circular wait or to detect its actual or potential occurrence.

In _________ , deadlocks occurs if each process in a set of processes requests a resource held by another process in the set.

A distributed snapshot algorithm assumes that messages are delivered in the order that they are sent and that no messages are lost.

With _________ control, the sites are organized in a tree structure, with one site serving as the root of the tree.

A true global state cannot be determined because of the time lapse associated with message transfer.

__________ means that no resource can be forcibly removed from a process holding it.

An advantage to nonpreemptive process migration is that it reacts well to sudden changes in load distribution.

The _________ of a process is the sequence of messages that have been sent and received along channels incident with the process.

An alternative approach to mutual exclusion involves the passing of a _________ among participating processes.

"A closed chain of processes exists, such that each process holds at least one resource needed by the next process in the chain," is a description of a __________ .

The __________ strategy transfers only those pages of the address space that are in main memory and have been modified.

_________ is the combined state of all processes.

One site is responsible for deadlock detection with _________ control.

In __________ , messages are the resources for which processes wait and deadlock occurs if each process in a set is waiting for a message from another process in the set and no process in the set ever sends a message.

A property of a fully __________ algorithm is that all nodes expend equal effort, on average, in effecting a final decision.