Identify and handle race conditions

Q: Identify and handle race conditions

This question evaluates understanding of concurrency, race conditions, synchronization mechanisms, and performance trade-offs in designing thread-safe in-memory data structures like key-value stores and hit counters.

Q: How do I approach System Design interview questions?

System Design questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master system design interviews.

Question

Concurrency in an In-Memory Key-Value Store and Hit Counter

Context and Assumptions

Assume you are implementing an in-memory key-value store and a hit counter within a single process, shared by multiple threads:

KeyValueStore supports: get(k), put(k, v), delete(k), and optionally compareAndSet(k, expected, new).
HitCounter supports: increment([key]), getCount([key]) — either a single global counter or per-key counters.
Data structure backing the store is a hash map with buckets and possible resizing.
High read-to-write ratio is common, but hot keys and heavy write bursts can occur.

Tasks

Identify the race conditions that can occur under concurrent access.
Propose thread-safety mechanisms (coarse-/fine-grained locks, read/write locks, atomic operations, lock-free designs) and explain their correctness.
Discuss performance trade-offs of the chosen mechanisms.
Outline how to test and validate concurrency behavior.

Identify and handle race conditions

Concurrency in an In-Memory Key-Value Store and Hit Counter

Context and Assumptions

Tasks

Solution

Comments (0)

Identify and handle race conditions

Overview

Concurrency in an In-Memory Key-Value Store and Hit Counter

Context and Assumptions

Tasks

Solution

Comments (0)