Summary  
This chapter explains how to use locks to ensure exclusive access to shared data and queues to safely pass information between concurrent tasks, preventing race conditions.

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.

Når du arbeider med tråder eller prosesser, må du ofte dele data eller koordinere handlingene deres. Uten riktig synkronisering kan to tråder forsøke å oppdatere den samme variabelen samtidig, noe som fører til uforutsigbare resultater kjent som **kappløpsforhold**. For å forhindre dette tilbyr Python synkroniseringsprimitiver som **låser**, **køer** og **delt minne**.

En **lås** er en enkel mekanisme som sikrer at kun én tråd kan få tilgang til et stykke kode eller data om gangen. Hvis én tråd får tak i en lås, må andre tråder som prøver å få tak i den vente til den blir frigitt. Dette forhindrer at flere tråder gjør motstridende endringer.

**Køer** er et annet kraftig verktøy for sikker kommunikasjon mellom tråder og prosesser. En kø lar én tråd eller prosess trygt legge inn data, mens en annen tar det ut. Klassen `queue.Queue` (for tråder) og `multiprocessing.Queue` (for prosesser) håndterer all nødvendig låsing internt, slik at du ikke trenger å bekymre deg for kappløpsforhold.

Med **delt minne** kan prosesser få direkte tilgang til de samme dataene, men du må bruke synkroniseringsprimitiver som låser eller semaforer for å unngå konflikter. I de fleste tilfeller er det enklere og tryggere å bruke køer for kommunikasjon mellom prosesser.

Videoen ovenfor viser hvordan en lås kan forhindre at to tråder ødelegger delte data, og hvordan en kø kan brukes til å trygt overføre data mellom samtidige oppgaver.

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.

Hvilken synkroniseringsprimitiv bør du bruke for å dele data trygt mellom flere tråder i Python?

Du vil tilegne deg praktiske ferdigheter i bruk av Python-moduler og import for effektiv kodehåndtering. Behersk avanserte teknikker for feilhåndtering for mer pålitelige applikasjoner, automatiser filoperasjoner med filhåndtering, og lær robuste teststrategier med Pytest og Unittest for å sikre kodeintegritet.

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.

Synkronisering og kommunikasjon