Warning:
JavaScript is turned OFF. None of the links on this page will work until it is reactivated.
If you need help turning JavaScript On, click here.
This Concept Map, created with IHMC CmapTools, has information related to: ch 11 Global States, global states has distributed garbage collection: an object is considered to be garbage if there are no longer any references distributed deadlock detection: a distributed deadlock occurs when each of a collection of processes waits for another process to send it a message, waits for relationship distributed termination detection: the problem here is to detect that a distributed algorithm has terminated, distributed debugging has observing consistent global states, the observed processes enclose their vector clock values with their state messages, distributed debugging has evaluating definitely, global states has to observe the succession of states of the system, -consistent global state- is one that corresponds to a consistent cut, distributed debugging has evaluating possibly and defintely in synchronous systems, distributed debugging has collecting states locally from processes, global states has snapshot algorithm, global states has global state predicate- is a function that maps from the set of global states of processes in the system, distributed debugging has evaluating possibly a given state may in general be reached from several states at the previous level so the monitor process should take care to evaluate the consistency of each state only once