Distributed Systems
CS3.401True / False (with reasoning)
Exposes shallow understanding. Always include the reason.
Under CAP, CA (Consistency + Availability without Partition tolerance) is achievable in real distributed systems.
Scalar Lamport clocks are strongly consistent.
Chandy-Lamport works on non-FIFO channels.
Causal order delivery degenerates to FIFO when both messages are from the same sender.
Ricart-Agrawala requires FIFO channels.
Maekawa V1 is deadlock-free.
In the OR resource model, a cycle in the WFG is sufficient to declare deadlock.
FLP impossibility says distributed consensus is impossible.
OM(m) has polynomial message complexity.
3PC is widely used in production for distributed transactions.
Raft tolerates Byzantine failures.
A new Raft leader can directly commit entries from prior terms by replicating them to a majority.
GHS combining Rule B requires equal levels AND mutual MWOE choice.
In GFS, the master persistently logs chunk replica locations.
Atomic record append in GFS guarantees exactly-once semantics.