SEARCH LAVACS

Find a topic across LavaCS

Search textbooks, study guides, six encyclopedias, experiments and comparisons.

50 results · page 1 of 3

Distributed Systems · Comparisons and explanations

At-most-once versus at-least-once delivery

Compare at-most-once and at-least-once delivery through acknowledgment loss, redelivery and idempotent business effects.

Intermediate

Distributed Systems · Comparisons and explanations

Replication versus backup

Distinguish replicas used for service continuity from backups used for reconstruction, including mistaken changes, retention and tested restoration.

Intermediate

Distributed Systems · Comparisons and explanations

Sequential consistency versus linearizability

Compare sequential consistency and linearizability through register histories, per-client order, real-time precedence and compositional reasoning.

Intermediate

Distributed Systems · Failures and antipatterns

Cascading failures

Trace how one slowdown spreads through retries, queues and shifted traffic, then protect useful work with admission and deadline policies.

Intermediate

Distributed Systems · Failures and antipatterns

Duplicate message delivery

Separate message redelivery from business effects and design deduplication around the point where acknowledgements can be lost.

Intermediate

Distributed Systems · Failures and antipatterns

Partial commits across systems

Trace partial success across independent services and design recovery around actual atomicity boundaries and uncertain outcomes.

Intermediate

Distributed Systems · Failures and antipatterns

Split brain

Investigate competing writers by separating quorum decisions, leadership terms and fencing of external resources.

Intermediate

Distributed Systems · Failures and antipatterns

Inconsistency from stale caches

Trace stale values after source updates and define freshness using invalidation, refills, versions and authorization boundaries.

Intermediate

Distributed Systems · Experiments and implementations

Measure hash-placement changes for fixed keys

Compare three and four owners for ten thousand fixed keys, verifying movement targets, skew, virtual points and reproducible old placement.

Intermediate

Distributed Systems · Experiments and implementations

Assign logical clocks to an event DAG

Compute ancestor sets and Lamport labels in a three-process model, checking causal direction, a converse counterexample and wall-clock reversal.

Intermediate

Distributed Systems · Experiments and implementations

Check quorum sets and stale responses

Enumerate five-member subsets and version states to distinguish intersection, availability, insufficient storage acknowledgments and stale-first selection.

Intermediate

Distributed Systems · Experiments and implementations

Read through replica lag and required positions

Advance write, read and replica application explicitly, distinguishing stale visibility, required-position waiting and a separate failover-loss scenario.

Intermediate

Distributed Systems · Experiments and implementations

Test retries after a lost response

Drop a real local server response after commit, then verify same-ID retry, payload mismatch and the durable effect count.

Intermediate