Concurrency considerations in LLD - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is concurrency in system design?

Concurrency means multiple tasks or processes are happening at the same time or overlapping in time to improve efficiency and performance.

beginner

Why do we need locks or mutexes in concurrent systems?

Locks or mutexes prevent multiple processes from changing the same data at the same time, avoiding errors and data corruption.

intermediate

What is a race condition?

A race condition happens when two or more processes try to change shared data at the same time, causing unpredictable results.

intermediate

Explain deadlock in concurrency.

Deadlock is when two or more processes wait forever for each other to release resources, so none can continue.

intermediate

What is the difference between concurrency and parallelism?

Concurrency is about managing multiple tasks at once, possibly by switching between them. Parallelism is running multiple tasks exactly at the same time using multiple processors.

What problem does a mutex solve in concurrent systems?

A Automatically fixes bugs in code

B Increases the speed of a single process

C Allows unlimited access to shared resources

D Prevents multiple processes from accessing shared data simultaneously

Mutexes ensure only one process accesses shared data at a time to avoid conflicts.

Which of the following best describes a race condition?

A Processes waiting forever for each other

B Multiple processes accessing shared data causing unpredictable results

C A process running faster than expected

D A system crash due to hardware failure

Race conditions occur when concurrent processes access shared data without proper synchronization.

Deadlock occurs when:

A A single process crashes

B Processes run in parallel without issues

C Processes wait forever for resources held by each other

D Resources are never requested

Deadlock is a state where processes wait endlessly for resources locked by each other.

Which technique helps avoid race conditions?

A Using locks or synchronization mechanisms

B Running processes sequentially only

C Ignoring shared data

D Increasing CPU speed

Locks and synchronization ensure safe access to shared data, preventing race conditions.

What is the main difference between concurrency and parallelism?

A Concurrency is multitasking; parallelism is multitasking on multiple processors

B Concurrency is faster than parallelism

C Parallelism uses one processor only

D They are the same

Concurrency manages multiple tasks by switching; parallelism runs tasks simultaneously on multiple processors.

Describe common concurrency problems and how to handle them.

Think about what happens when multiple processes share data or resources.

Explain the difference between concurrency and parallelism with examples.

Consider how tasks are managed or executed at the same time.

Practice

1. What is the main purpose of using locks in concurrent systems?

easy

A. To allow unlimited access to shared resources

B. To prevent multiple threads from accessing shared data simultaneously

C. To speed up the execution of a single thread

D. To reduce memory usage in the system

Solution

1. Step 1: Understand concurrency risks

   When multiple threads access shared data at the same time, it can cause errors or inconsistent results.

2. Step 2: Role of locks

   Locks ensure only one thread accesses the shared data at a time, preventing conflicts and data corruption.

3. Final Answer:

   To prevent multiple threads from accessing shared data simultaneously -> Option B

4. Quick Check:

   Locks protect shared data = C [OK]

Hint: Locks protect shared data from simultaneous access [OK]

Common Mistakes:

• Thinking locks speed up single-thread execution
• Believing locks allow unlimited resource access
• Confusing locks with memory optimization

2. Which of the following is the correct way to acquire a lock in a typical low-level design?

easy

A. lock.notify() before accessing shared data

B. lock.release() before accessing shared data

C. lock.wait() after accessing shared data

D. lock.acquire() before accessing shared data

Solution

1. Step 1: Understand lock usage order

   To safely access shared data, a thread must first acquire the lock to block others.

2. Step 2: Correct method to acquire lock

   The method lock.acquire() is used to obtain the lock before accessing shared data.

3. Final Answer:

   lock.acquire() before accessing shared data -> Option D

4. Quick Check:

   Acquire lock first = A [OK]

Hint: Acquire lock before shared data access [OK]

Common Mistakes:

• Releasing lock before access
• Using wait or notify incorrectly
• Confusing acquire with release

3. Consider this pseudocode for two threads incrementing a shared counter without locks:

Thread 1: temp = counter
          temp = temp + 1
          counter = temp

Thread 2: temp = counter
          temp = temp + 1
          counter = temp

What is the possible final value of counter if it starts at 0?

medium

A. 2

B. Any negative number

C. 1

D. 0

Solution

1. Step 1: Analyze concurrent increments without locks

   Both threads read the same initial value 0, increment it to 1, and write back 1, causing one increment to be lost.

2. Step 2: Determine final counter value

   Because of race condition, the counter may only increase once, resulting in final value 1 instead of 2.

3. Final Answer:

   1 -> Option C

4. Quick Check:

   Race condition causes lost update = 1 [OK]

Hint: Without locks, increments can overwrite each other [OK]

Common Mistakes:

• Assuming both increments always succeed
• Ignoring race conditions
• Thinking counter can be negative here

4. In the following code snippet, what is the main concurrency issue?

lock.acquire()
shared_data.append(1)
# Missing lock.release()

medium

A. Deadlock due to missing lock release

B. Data race on shared_data

C. Syntax error in lock usage

D. No issue, code is safe

Solution

1. Step 1: Identify missing lock release

   The code acquires a lock but never releases it, so other threads waiting for the lock will block forever.

2. Step 2: Understand deadlock impact

   This causes a deadlock where threads cannot proceed, halting system progress.

3. Final Answer:

   Deadlock due to missing lock release -> Option A

4. Quick Check:

   Missing release causes deadlock = A [OK]

Hint: Always release locks after acquiring [OK]

Common Mistakes:

• Thinking it's a syntax error
• Assuming no issue without release
• Confusing deadlock with data race

5. You design a system where multiple threads read and write a shared cache. To improve performance, you want to allow multiple readers but only one writer at a time. Which concurrency control mechanism fits best?

hard

A. Use a read-write lock allowing concurrent reads but exclusive writes

B. Use a simple mutex lock for all access

C. Use no locks and rely on thread scheduling

D. Use a semaphore with count 1 for all operations

Solution

1. Step 1: Understand concurrency needs for readers and writers

   Multiple readers can safely access shared data simultaneously, but writers need exclusive access to avoid conflicts.

2. Step 2: Choose appropriate lock type

   A read-write lock allows many readers at once but only one writer, balancing concurrency and safety efficiently.

3. Final Answer:

   Use a read-write lock allowing concurrent reads but exclusive writes -> Option A

4. Quick Check:

   Read-write lock fits multiple readers, single writer = B [OK]

Hint: Read-write locks allow many readers, one writer [OK]

Common Mistakes:

• Using simple mutex reduces concurrency
• Ignoring need for exclusive write access
• Relying on no locks causes data races