SEARCH LAVACS

Find a topic across LavaCS

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

34 results · page 1 of 2

Concurrency · Comparisons and explanations

Cache coherence versus memory consistency

Distinguish per-location cache coherence from memory consistency across locations, including synchronization, false sharing and language-level rules.

Intermediate

Concurrency · Failures and antipatterns

The ABA problem

Trace intervening state changes when a value returns to A, separating CAS comparison from reference lifetime and safe reclamation.

Intermediate

Concurrency · Failures and antipatterns

Deadlock: a cycle of waiting

Trace a wait cycle and distinguish prevention from detection, recovery and harmless contention.

Intermediate

Concurrency · Failures and antipatterns

Slowdowns caused by false sharing

Investigate coherence interference between independent fields using a controlled layout comparison and account for padding costs.

Intermediate

Concurrency · Failures and antipatterns

Lock convoys

Separate lock holding from acquisition waiting and investigate handoff and scheduling at a shared serialization point.

Intermediate

Concurrency · Failures and antipatterns

Priority inversion

Trace the lock owner needed by a high-priority task and distinguish priority inheritance from a complete bound on blocking time.

Intermediate

Concurrency · Failures and antipatterns

The thundering-herd problem

Trace excess wakeups for limited work and design predicate checks together with notification granularity.

Intermediate

Concurrency · Failures and antipatterns

TOCTOU races

Trace changes between validation and use, and choose object-bound operations or conditional updates at the required boundary.

Intermediate

Concurrency · Experiments and implementations

Comparing atomic-counter memory orders

Compare relaxed and sequentially consistent atomic increments while keeping final-count correctness separate from publication ordering and measured runtime.

Intermediate

Concurrency · Experiments and implementations

Applying load to a bounded channel

Apply a controlled burst to a two-item queue, observe rejection and subsequent admission, and distinguish buffer capacity from processing capacity.

Intermediate

Concurrency · Experiments and implementations

Comparing false sharing with and without padding

Update separate counters from two threads and compare adjacent and spaced layouts, keeping observed address distance distinct from hardware-specific performance.

Intermediate

Concurrency · Experiments and implementations

Reproducing deadlocks through lock ordering

Construct circular waiting with opposite lock orders, bound the demonstration with acquisition timeouts, and compare it with a consistent lock order.

Intermediate

Concurrency · Experiments and implementations

Testing thread cancellation and resource cleanup

Request deferred POSIX thread cancellation and verify cleanup of a held mutex, separating acceptance of the request from completion of thread termination.

Intermediate