global state and snapshot recording algorithm

1234567891011
Across
  1. 3. Recorded state of a process or system
  2. 7. Condition C1 preserves the law of ___________ of messages
  3. 8. A collection of local states and channel states.
  4. 9. Model in which each channel acts as a first-in-first-out message queue
  5. 11. In O(e) message complexity, e represents the number of ___________ in the network. Edges
Down
  1. 1. Opposite of a consistent global state
  2. 2. _______Property preserved by FIFO channels
  3. 4. Control message used by the Chandy–Lamport algorithm
  4. 5. Measure represented by d in O(d) complexity
  5. 6. Units to which the marker is sent during snapshot initiation
  6. 7. Communication path between processes
  7. 8. Communication that allows multiple processes to communicate simultaneously
  8. 10. Event in which a process transmits a message