Thread safety concepts in Ruby - Cheat Sheet & Quick Revision

Recall & Review

beginner

What does thread safety mean in programming?

Thread safety means that code can be safely run by multiple threads at the same time without causing errors or unexpected behavior.

beginner

Why can shared data cause problems in multithreaded programs?

Because if two or more threads try to change the same data at the same time, it can lead to conflicts or wrong results.

intermediate

What is a race condition?

A race condition happens when the program's behavior depends on the order or timing of threads, causing unpredictable results.

intermediate

How does a mutex help with thread safety?

A mutex is like a lock that only lets one thread access a piece of code or data at a time, preventing conflicts.

beginner

What is the difference between thread-safe and non-thread-safe code?

Thread-safe code works correctly when used by many threads at once. Non-thread-safe code can cause errors or crashes if used by multiple threads simultaneously.

What problem does thread safety aim to solve?

A Making programs run faster on a single thread

B Preventing multiple threads from causing data conflicts

C Reducing the size of the program

D Improving user interface design

Thread safety prevents data conflicts when multiple threads access shared data.

Which tool is commonly used to control access to shared data in Ruby threads?

A Mutex

B Array

C Hash

D Class

Mutex is used to lock shared data so only one thread can access it at a time.

What is a race condition?

A When program behavior depends on thread timing causing errors

B When threads run in a fixed order

C When a program runs too slowly

D When threads never share data

Race conditions happen when timing of threads causes unpredictable program behavior.

Which of these is NOT a characteristic of thread-safe code?

A Works correctly with multiple threads

B Prevents race conditions

C Uses locks or synchronization

D Causes data corruption when accessed by many threads

Thread-safe code avoids data corruption, so option B is not a characteristic.

In Ruby, what happens if you don't use thread safety techniques when sharing data?

A The program always runs faster

B Threads will not run at all

C Data may become inconsistent or corrupted

D The program will use less memory

Without thread safety, shared data can become inconsistent or corrupted.

Explain what thread safety means and why it is important in Ruby programming.

Think about what happens when many threads try to use the same data.

Describe how a mutex works to keep code thread-safe.

Imagine a key that only one person can hold at a time.

Practice

1. What is the main purpose of thread safety in Ruby programs?

easy

A. To make the program run slower

B. To prevent errors when multiple threads access shared data

C. To allow threads to run without any synchronization

D. To avoid using threads altogether

Solution

1. Step 1: Understand thread safety concept

   Thread safety means making sure multiple threads do not cause errors when they access the same data.

2. Step 2: Identify the main goal

   The main goal is to prevent errors and data corruption when threads run at the same time.

3. Final Answer:

   To prevent errors when multiple threads access shared data -> Option B

4. Quick Check:

   Thread safety = prevent errors [OK]

Hint: Thread safety means safe shared data access [OK]

Common Mistakes:

• Thinking thread safety slows down programs
• Believing threads never need synchronization
• Confusing thread safety with avoiding threads

2. Which Ruby code snippet correctly uses a Mutex to protect a shared variable counter?

easy

A. mutex.synchronize { counter += 1 }

B. mutex.lock { counter += 1 }

C. mutex.unlock { counter += 1 }

D. mutex.wait { counter += 1 }

Solution

1. Step 1: Recall Mutex usage in Ruby

   Mutex uses the synchronize method to safely run code blocks.

2. Step 2: Check each option

   Only mutex.synchronize { ... } is the correct syntax to lock and unlock automatically.

3. Final Answer:

   mutex.synchronize { counter += 1 } -> Option A

4. Quick Check:

   Mutex uses synchronize method [OK]

Hint: Use synchronize to lock Mutex safely [OK]

Common Mistakes:

• Using lock or unlock methods incorrectly
• Trying to pass a block to lock or unlock
• Confusing wait with Mutex methods

3. What will be the output of this Ruby code?

require 'thread'
mutex = Mutex.new
counter = 0
threads = 5.times.map do
  Thread.new do
    10.times do
      mutex.synchronize { counter += 1 }
    end
  end
end
threads.each(&:join)
puts counter

medium

A. 10

B. 0

C. 5

D. 50

Solution

1. Step 1: Analyze thread and loop counts

   There are 5 threads, each incrementing counter 10 times, total increments = 5 * 10 = 50.

2. Step 2: Understand Mutex protection

   Mutex ensures increments happen safely without lost updates, so counter will be exactly 50.

3. Final Answer:

   50 -> Option D

4. Quick Check:

   5 threads * 10 increments = 50 [OK]

Hint: Multiply threads by increments with Mutex [OK]

Common Mistakes:

• Ignoring Mutex and expecting less than 50
• Confusing thread count with increments
• Assuming race conditions reduce count

4. Identify the problem in this Ruby code that uses threads:

counter = 0
threads = 3.times.map do
  Thread.new do
    100.times { counter += 1 }
  end
end
threads.each(&:join)
puts counter

medium

A. Thread.new syntax is incorrect

B. Threads are not joined, so program ends early

C. No Mutex used, so race condition may cause wrong counter value

D. Counter variable is not initialized

Solution

1. Step 1: Check thread safety of counter increment

   Multiple threads increment counter without synchronization, causing race conditions.

2. Step 2: Identify missing Mutex usage

   Without Mutex, increments can overlap and produce incorrect final value.

3. Final Answer:

   No Mutex used, so race condition may cause wrong counter value -> Option C

4. Quick Check:

   Missing Mutex causes race condition [OK]

Hint: Always use Mutex to protect shared variables [OK]

Common Mistakes:

• Thinking threads are not joined (they are)
• Assuming counter needs initialization (it is initialized)
• Believing Thread.new syntax is wrong

5. You want to safely update a shared hash results from multiple threads in Ruby. Which approach correctly ensures thread safety?

hard

A. Use a Mutex and wrap all results[key] = value assignments inside mutex.synchronize

B. Use Thread.new without any synchronization because Ruby hashes are thread-safe

C. Create a new hash inside each thread and merge them later without synchronization

D. Use sleep to delay threads and avoid conflicts

Solution

1. Step 1: Understand thread safety for shared hashes

   Ruby hashes are not thread-safe for writes; concurrent writes can cause errors or data loss.

2. Step 2: Use Mutex to protect hash updates

   Wrapping assignments inside mutex.synchronize ensures only one thread writes at a time.

3. Final Answer:

   Use a Mutex and wrap all results[key] = value assignments inside mutex.synchronize -> Option A

4. Quick Check:

   Mutex protects shared hash writes [OK]

Hint: Protect shared hash writes with Mutex synchronize [OK]

Common Mistakes:

• Assuming Ruby hashes are thread-safe for writes
• Using sleep to avoid conflicts (not reliable)
• Merging hashes without synchronization risks data loss