SEARCH LAVACS

Find a topic across LavaCS

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

541 results · page 20 of 23

Concurrency · Design patterns and optimization

Admission control

Protect a constrained resource before work begins by defining concurrency limits, queueing, rejection and deadlines.

Intermediate

Distributed Systems · Design patterns and optimization

Bounded queues and backpressure: control the waiting work

Make waiting, rejection, and load reduction explicit when arrivals exceed processing capacity. Work through concrete cases and separate mathematical assumptions from implementation checks.

Intermediate

Distributed Systems · Design patterns and optimization

Isolate resource occupancy with bulkheads

Compare a shared pool with reserved dependency pools, tracing stalled work, idle capacity, parent waits and release paths.

Intermediate

Databases · Design patterns and optimization

Cache versioning

Design cache keys, generations and publication order so that a refresh cannot silently mix incompatible versions.

Intermediate

Distributed Systems · Design patterns and optimization

Trace circuit-breaker suppression and recovery

Trace closed, open and half-open states while separating failure windows, bounded probes, local refusals and fallback semantics.

Intermediate

Distributed Systems · Design patterns and optimization

Limit placement changes with consistent hashing

Insert a ring point and distinguish virtual points, capacity weighting, replica selection, configuration generations and live migration.

Intermediate

Concurrency · Design patterns and optimization

Sharing data through copy-on-write

Keep readers on immutable snapshots while separating copying, publication and mutable element ownership.

Intermediate

Computer Architecture · Design patterns and optimization

Data-oriented memory layout

Choose AoS, SoA or blocked layouts from the fields and access sequence a computation actually uses.

Intermediate

Distributed Systems · Design patterns and optimization

Propagate remaining request time

Allocate a 300 ms end-to-end budget across services and distinguish clocks, retries, cancellation and already committed effects.

Intermediate

Distributed Systems · Design patterns and optimization

Reconstruct state from authoritative event history

Use deposits, withdrawals and snapshots to reason about deterministic replay, concurrent append, event evolution, corrections and external effects.

Intermediate

Distributed Systems · Design patterns and optimization

Exponential backoff and jitter: avoid amplifying overload

Combine capped waiting, randomization, an overall deadline, and a contract for retryable operations. Work through concrete cases and separate mathematical assumptions from implementation checks.

Intermediate

Distributed Systems · Design patterns and optimization

Shed load to protect useful completion

Use concurrency, bounded queues, deadlines and priorities to reject excess work while preserving result semantics and recovery.

Intermediate

Databases · Design patterns and optimization

Read-through caching

Centralize cache-miss loading while making concurrency, negative results and origin failures explicit.

Intermediate

Distributed Systems · Design patterns and optimization

Choose owners with rendezvous hashing

Rank key-node scores and distinguish addition, removal, ties, replication, weighting and lookup cost.

Intermediate

Distributed Systems · Design patterns and optimization

Bound additional load with a retry budget

Use original requests, extra-attempt allowances and multilayer amplification to distinguish count limits, retry timing and idempotency.

Intermediate