Saral Shiksha Yojna
Courses/Distributed Systems

Distributed Systems

CS3.401
Prof. Kishore KothapalliMonsoon 2025-264 credits

Fill in the Blanks

Formulas, keywords, theorem statements.

Under CAP, ____ is unavoidable in real distributed systems, forcing a trade between C and A.

Vector clock receive rule: ∀k V[k] = ____, then V[i]++.

Matrix clock GC condition: discard messages with timestamp ≤ t when ____ ≥ t.

Acharya-Badrinath snapshot uses ____ messages total.

BSS condition (a): V_m[j] = ____.

Ricart-Agrawala uses ____ messages per CS.

Maekawa optimum quorum size K = D = ____.

Suzuki-Kasami token-send condition: RN[i] = ____.

OR model deadlock criterion is a ____ in the WFG.

Byzantine Agreement requires n ≥ ____ processes.

Crash consensus total messages: ____.

The 2PC point-of-no-return is when the coordinator writes ____ to stable log.

Raft commits an entry when it is replicated to a ____ in the current term.

GHS maximum fragment level is at most ____.

GHS message complexity is ____.

GFS default chunk size is ____ MB.

GFS default replication factor is ____ across racks.

GFS deleted files are retained hidden for ____ days before garbage collection.