GIL (Global Interpreter Lock) impact in Ruby - Mini Project: Build & Apply
counter and set it to 0.Use a simple variable assignment to start the counter at zero.
thread_count and set it to 5.Use a variable to store how many threads you want to create.
threads and use a thread_count.times do |i| ... end loop to create threads. Each thread should increment counter 1000 times using counter += 1.Create threads inside a loop and make each thread add 1 to the counter 1000 times. Use threads.each(&:join) to wait for all threads to finish.
puts counter to display the final value of counter after all threads finish.Use puts counter to print the final count after all threads complete.
Practice
What does the Global Interpreter Lock (GIL) in Ruby do?
Solution
Step 1: Understand the role of GIL
The GIL is a lock that ensures only one thread runs Ruby code at once.Final Answer:
Allows only one thread to execute Ruby code at a time -> Option DQuick Check:
GIL = single-thread execution [OK]
- Thinking GIL allows true parallel Ruby code execution
- Believing GIL stops all threading
- Assuming GIL speeds up multi-threading
Which Ruby code snippet correctly starts two threads that print numbers?
Option A:
threads = [Thread.new { puts 1 }, Thread.new { puts 2 }]
threads.each(&:join)
Option B:
Thread.new { puts 1 }
Thread.new { puts 2 }
Option C:
threads = Thread.new { puts 1 }
threads = Thread.new { puts 2 }
threads.join
Option D:
Thread.start { puts 1 }
Thread.start { puts 2 }
Solution
Step 1: Analyze thread creation and joining
Creates two threads and waits for both to finish. Creates two threads and calls join on both, ensuring both finish.Final Answer:
Creates two threads and waits for both to finish -> Option AQuick Check:
Thread.new + join = wait for threads [OK]
- Not calling join and missing thread completion
- Overwriting thread variables losing references
- Using non-existent Thread.start method
What will be the output of this Ruby code considering the GIL?
count = 0
threads = 5.times.map do
Thread.new do
1000.times { count += 1 }
end
end
threads.each(&:join)
puts count
Solution
Step 1: Understand thread increments with GIL
GIL allows one thread at a time, but count += 1 is not atomic and can cause race conditions.Final Answer:
May be less than 5000 due to race conditions -> Option CQuick Check:
Non-atomic increments + threads = race condition [OK]
- Assuming GIL makes increments atomic
- Expecting exact 5000 without synchronization
- Ignoring thread interference on variables
Identify the problem in this Ruby code using threads and fix it:
count = 0
threads = 3.times.map do
Thread.new do
100.times { count += 1 }
end
end
threads.each(&:join)
puts count
Solution
Step 1: Identify race condition on count variable
Multiple threads increment count without synchronization causing race conditions.Final Answer:
Add a Mutex to synchronize increments -> Option AQuick Check:
Mutex prevents race conditions [OK]
- Ignoring race conditions on shared variables
- Trying to kill threads instead of synchronizing
- Assuming GIL handles all thread safety
You want to speed up a CPU-heavy Ruby program using threads. Considering the GIL, what is the best approach?
Solution
Step 1: Understand GIL impact on CPU-bound threads
GIL allows only one thread to run Ruby code at a time, so threads don't speed up CPU-heavy tasks.Final Answer:
Use multiple processes instead of threads -> Option BQuick Check:
Processes bypass GIL for CPU parallelism [OK]
- Believing threads run CPU tasks in parallel with GIL
- Trying to disable GIL (not possible in standard Ruby)
- Using threads for CPU tasks instead of I/O
Ready to prove it?
Pass the test and this pattern moves unknown
