Summary  
This chapter explains how to prevent race conditions and coordinate concurrent tasks by using locks for exclusive access to shared data, and queues or shared memory for safe inter-thread and inter-process communication.

General domain of usage  
Concurrent programming

In this video, we'll use the analogy of The Shared Recipe Book to explain synchronization and communication in Python threads and processes. Imagine two chefs (representing threads) working in a busy kitchen. They both need to update the 'Eggs Used' count in a shared recipe book. If both chefs try to write in the book at the same time, the numbers can get mixed up—this is called a race condition. For example, both chefs see the count as 5, each adds 1, and both write down 6—when it should be 7! This is data corruption caused by unsynchronized access.

To prevent this, we introduce a Lock, which acts like a physical key to the recipe book. Only the chef holding the key can open the book and update the count. Other chefs must wait their turn until the key is available. This ensures that only one chef updates the book at a time, keeping the numbers accurate—just like how a Python lock prevents threads from corrupting shared data.

Now, let's talk about Queues. Think of a Queue as a note box next to the recipe book. Instead of updating the book directly, each chef writes a note with their update and puts it in the box. The box is managed so that only one note is processed at a time, and updates are made safely in order. In Python, queues handle all the necessary locking internally, making it easy for threads or processes to communicate without worrying about race conditions.

Finally, Shared Memory is like a chalkboard on the kitchen wall, visible to all chefs. It's fast because anyone can write on it, but if two chefs write at the same time, their notes can overlap and become unreadable—like smudged chalk. To prevent this, the chefs still need to use the key (Lock) before writing on the chalkboard, ensuring only one writes at a time.

In summary, whether you're using a recipe book (shared data), a note box (queue), or a chalkboard (shared memory), synchronization tools like locks and queues are essential for keeping your data accurate and your kitchen (program) running smoothly. Python provides these tools to help you coordinate threads and processes safely and efficiently.

When working with threads or processes, you often need to share data or coordinate their actions. Without proper synchronization, two threads might try to update the same variable at the same time, leading to unpredictable results known as **race conditions**. To prevent this, Python provides synchronization primitives such as **locks**, **queues**, and **shared memory**.

A **lock** is a simple mechanism that ensures only one thread can access a piece of code or data at a time. If one thread acquires a lock, other threads trying to acquire it will have to wait until it is released. This prevents multiple threads from making conflicting changes.

**Queues** are another powerful tool for safe communication between threads and processes. A queue allows one thread or process to safely put data in, while another takes it out. The `queue.Queue` class (for threads) and `multiprocessing.Queue` (for processes) handle all the necessary locking internally, so you do not have to worry about race conditions.

With **shared memory**, processes can access the same data directly, but you must use synchronization primitives like locks or semaphores to avoid conflicts. In most cases, using queues is simpler and safer for inter-process communication.

The video above shows how a lock can prevent two threads from corrupting shared data, and how a queue can be used to safely pass data between concurrent tasks.

import threading

counter = 0
lock = threading.Lock()

def increment():
    global counter
    for _ in range(10000):
        with lock:  #  Ensuring only one thread enters this block at a time
            counter += 1

threads = []
for _ in range(5):
    t = threading.Thread(target=increment)
    threads.append(t)
    t.start()

for t in threads:
    t.join()

print("Final counter value:", counter)
# Without the lock, the final value would likely be wrong due to race conditions.
# With the lock, the result is always correct: 50000.

Which synchronization primitive would you use to safely share data between multiple threads in Python?

A deep dive into advanced structural programming concepts in Python, focusing on robust file handling, error management, concurrency, asynchronous programming and testing.

Master Python's exception system for robust error handling and debugging.

Explore advanced techniques for file operations and resource management using context managers.

Compare and apply Python's multithreading and multiprocessing modules for concurrent programming.

Master asynchronous programming in Python using the asyncio library for scalable I/O-bound applications.

Explore how to write, organize, and run tests using Python's unittest and pytest frameworks.

Synchronization and Communication