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.
IntermediateSEARCH LAVACS
Search textbooks, study guides, six encyclopedias, experiments and comparisons.
34 results · page 1 of 2
Concurrency · Comparisons and explanations
Distinguish per-location cache coherence from memory consistency across locations, including synchronization, false sharing and language-level rules.
IntermediateConcurrency · Comparisons and explanations
Compare overlapping work, actual simultaneous computation, I/O waiting, and the correctness of shared-state updates.
IntroductoryConcurrency · Concepts and theorems
Distinguish an indivisible access from an entire multi-step operation that must be coordinated.
IntermediateConcurrency · Concepts and theorems
Build a partial order from local order, communication, and transitivity rather than inferring causality from timestamps.
IntermediateConcurrency · Concepts and theorems
Place each operation between its invocation and response while preserving real-time precedence and the object sequential specification.
AdvancedConcurrency · Failures and antipatterns
Trace intervening state changes when a value returns to A, separating CAS comparison from reference lifetime and safe reclamation.
IntermediateConcurrency · Failures and antipatterns
Trace a wait cycle and distinguish prevention from detection, recovery and harmless contention.
IntermediateConcurrency · Failures and antipatterns
Investigate coherence interference between independent fields using a controlled layout comparison and account for padding costs.
IntermediateConcurrency · Failures and antipatterns
Recognize mutually interfering retries and measure completed work rather than mere activity.
IntermediateConcurrency · Failures and antipatterns
Separate lock holding from acquisition waiting and investigate handoff and scheduling at a shared serialization point.
IntermediateConcurrency · Failures and antipatterns
Trace the lock owner needed by a high-priority task and distinguish priority inheritance from a complete bound on blocking time.
IntermediateConcurrency · Failures and antipatterns
Inspect fairness and per-request waiting when aggregate throughput conceals excluded work.
IntermediateConcurrency · Failures and antipatterns
Trace excess wakeups for limited work and design predicate checks together with notification granularity.
IntermediateConcurrency · Failures and antipatterns
Trace changes between validation and use, and choose object-bound operations or conditional updates at the required boundary.
IntermediateConcurrency · Experiments and implementations
Compare relaxed and sequentially consistent atomic increments while keeping final-count correctness separate from publication ordering and measured runtime.
IntermediateConcurrency · Experiments and implementations
Apply a controlled burst to a two-item queue, observe rejection and subsequent admission, and distinguish buffer capacity from processing capacity.
IntermediateConcurrency · Experiments and implementations
Send a notification without changing the shared predicate and verify why returning from a condition wait does not itself authorize progress.
IntermediateConcurrency · Experiments and implementations
Update separate counters from two threads and compare adjacent and spaced layouts, keeping observed address distance distinct from hardware-specific performance.
IntermediateConcurrency · Experiments and implementations
Use a barrier to reproduce a specific interleaving, then compare it with a lock covering the complete shared-counter update.
IntroductoryConcurrency · Experiments and implementations
Construct circular waiting with opposite lock orders, bound the demonstration with acquisition timeouts, and compare it with a consistent lock order.
IntermediateConcurrency · Experiments and implementations
Hold total work constant while measuring how additional threads contend for one mutex-protected counter.
IntermediateConcurrency · Experiments and implementations
Request deferred POSIX thread cancellation and verify cleanup of a held mutex, separating acceptance of the request from completion of thread termination.
IntermediateConcurrency · Study guides
Fix cancellation at an explicit Event boundary and inspect child completion, finally cleanup and retained evidence of sent effects.
IntermediateConcurrency · Study guides
Separate atomic operations, cross-thread ordering and progress guarantees using a publication example and a memory-reclamation counterexample.
Advanced