0Pricing
Redis Caching & Messaging (Pub/Sub, Streams) · Ders

Lider Seçimi Kalıpları

Yüksek erişilebilirlik için Redis'in dağıtık hizmetlerde lider seçimini nasıl kolaylaştırabileceğini keşfedin.

Lider Seçimi Kalıpları, CoddyKit'te ücretsiz bir Redis Caching & Messaging (Pub/Sub, Streams) dersidir. Bu, 4 dersinin 2. dersidir. Aşağıdan dersin tamamını ücretsiz okuyabilir, sonra tarayıcıda yerleşik kod editörü ve 7/24 yapay zeka koçu ile uygulamalı olarak pratik yapabilirsin. Bu, Redis Caching & Messaging (Pub/Sub, Streams) öğrenme yolunun bir parçasıdır ve ilerlemeniz web ve CoddyKit uygulaması arasında senkronize olur. Redis Caching & Messaging (Pub/Sub, Streams) kursu toplamda 4 dersten oluşur.

Bu dersin bazı bölümleri henüz çevrilmemiş olup İngilizce olarak gösterilmektedir.

Why Leader Election?

In a distributed system, multiple instances of your application run simultaneously. Sometimes, you need one instance to perform a specific task, like processing a queue or coordinating updates, to avoid conflicts or duplicate work.

This is where leader election comes in. It's a process where distributed nodes agree on a single node to be the "leader" at any given time.

Redis for Election Coordination

Redis is an excellent choice for implementing leader election due to its speed, atomic operations, and strong consistency guarantees for single-key operations.

  • Atomic Operations: Commands like SETNX or SET ... NX EX execute entirely or not at all, preventing race conditions.
  • Persistence: If configured, Redis can persist data, making leader election state more durable.
  • Centralized State: Provides a single, agreed-upon source of truth for who the current leader is.

Basic Election: SETNX

The simplest way to attempt leader election with Redis is using the SETNX command. SETNX key value ("Set if Not eXists") sets a key only if it doesn't already exist. If the key is set, it returns 1; otherwise, 0.

The first process to successfully set the leader key becomes the leader.

import redis
import time

# Connect to Redis
r = redis.Redis(decode_responses=True)

LEADER_KEY = "my_app:leader_v1"
MY_ID = "process_A" # Unique ID for this process

print(f"Process {MY_ID} attempting to become leader...")

# Try to acquire leadership
if r.setnx(LEADER_KEY, MY_ID):
    print(f"Process {MY_ID} is now the leader!")
    # Simulate leader work
    time.sleep(3) # Work for 3 seconds
    # In a real scenario, the leader would perform tasks
    # and eventually release leadership or renew its lease.
    r.delete(LEADER_KEY) # Release leadership
    print(f"Process {MY_ID} released leadership.")
el:
    current_leader = r.get(LEADER_KEY)
    print(f"Process {MY_ID}: Another process ({current_leader}) is already the leader.")

The Problem: Leader Failure

Consider the basic SETNX approach. What if the elected leader (process_A from the last example) crashes immediately after setting the LEADER_KEY, but before it has a chance to delete it?

The LEADER_KEY would remain in Redis indefinitely, preventing any other process from becoming leader. This creates a permanent deadlock, breaking your distributed system's high availability.

TTL for Fault Tolerance

To prevent deadlocks, we must add an expiration time (Time-To-Live, or TTL) to the leader key. This ensures that even if a leader crashes, its leadership key will eventually expire, allowing a new election.

We can use the EXPIRE key seconds command right after SETNX to set a TTL.

import redis
import time

r = redis.Redis(decode_responses=True)

LEADER_KEY = "my_app:leader_v2"
MY_ID = "process_B"
LOCK_TTL = 10 # seconds

print(f"Process {MY_ID} attempting to become leader...")

if r.setnx(LEADER_KEY, MY_ID):
    r.expire(LEADER_KEY, LOCK_TTL) # Set expiration
    print(f"Process {MY_ID} is now the leader with TTL {LOCK_TTL}s!")
    # Simulate leader work for a short period
    time.sleep(LOCK_TTL // 2)
    print(f"Process {MY_ID} completed its short task.")
    if r.get(LEADER_KEY) == MY_ID: # Check if still leader before deleting
        r.delete(LEADER_KEY)
        print(f"Process {MY_ID} released leadership.")
    else:
        print(f"Process {MY_ID}: Leadership lost or expired already.")
el:
    current_leader = r.get(LEADER_KEY)
    print(f"Process {MY_ID}: Another process ({current_leader}) is already the leader.")

The SETNX + EXPIRE Race

While adding EXPIRE is better, a critical race condition still exists! Imagine this sequence:

  1. Process A calls SETNX LEADER_KEY process_A. It succeeds (returns 1).
  2. Process A then crashes before it can call EXPIRE LEADER_KEY 10.

The LEADER_KEY is set, but without a TTL, leading to the same deadlock situation as before. We need an atomic way to set the key and its expiration.

Atomic SET for Robustness

Redis provides a powerful, atomic SET command that combines setting a key's value and its expiration. The format is SET key value [EX seconds | PX milliseconds] [NX | XX].

  • NX: Only set the key if it does not already exist (like SETNX).
  • EX seconds: Set an expiration time in seconds.
  • PX milliseconds: Set an expiration time in milliseconds.

Using SET LEADER_KEY MY_ID NX EX 10 ensures that both conditions (key not existing AND expiration) are applied atomically.

import redis
import time

r = redis.Redis(decode_responses=True)

LEADER_KEY = "my_app:leader_v3"
MY_ID = "process_C"
LOCK_TTL = 10 # seconds

print(f"Process {MY_ID} attempting to become leader atomically...")

# Try to acquire leadership using atomic SET with NX and EX
# This command returns True if the key was set, False otherwise.
if r.set(LEADER_KEY, MY_ID, nx=True, ex=LOCK_TTL):
    print(f"Process {MY_ID} is now the leader with atomic TTL {LOCK_TTL}s!")
    # Simulate leader work
    time.sleep(LOCK_TTL // 2)
    print(f"Process {MY_ID} still working as leader.")
    if r.get(LEADER_KEY) == MY_ID: # Important: check value before deleting!
        r.delete(LEADER_KEY)
        print(f"Process {MY_ID} gracefully released leadership.")
    else:
        print(f"Process {MY_ID}: Leadership lost or expired already.")
el:
    current_leader = r.get(LEADER_KEY)
    print(f"Process {MY_ID}: Another process ({current_leader}) is already the leader.")

Maintaining Leadership: Heartbeats

Once a leader is elected using the atomic SET command, it needs to periodically signal that it's still alive and capable of leading. This is done through "heartbeats."

A heartbeat involves the leader refreshing the expiration time of its leadership key before it expires (e.g., using EXPIRE LEADER_KEY NEW_TTL or PEXPIRE). If the leader fails to send heartbeats, its key will expire, triggering a new election among the remaining processes.

Check Your Understanding

Which of the following are benefits of using the atomic SET key value NX EX seconds command for leader election compared to separate SETNX and EXPIRE commands?

Recap: Leader Election

We've explored how Redis can facilitate leader election in distributed systems. We started with basic SETNX, identified its pitfalls, and learned to improve it with EXPIRE.

Crucially, we discovered the robust and atomic SET key value NX EX seconds command to prevent race conditions and ensure keys always have an expiration. Finally, we touched upon the importance of leader heartbeats to maintain active leadership.

Sıkça Sorulan Sorular

“Lider Seçimi Kalıpları” dersi ücretsiz mi?

Evet — “Lider Seçimi Kalıpları” dersin tüm metni burada web'de ücretsiz olarak okunabilir. Etkileşimli olarak pratik yapmak (yerleşik kod editörü ve 7/24 yapay zeka koçu) ve Redis Caching & Messaging (Pub/Sub, Streams) kursunun geri kalanını açmak için CoddyKit PRO'ya yükselt. Redis Caching & Messaging (Pub/Sub, Streams) kursu toplamda 4 dersten oluşur.

“Lider Seçimi Kalıpları” dersinde ne öğreneceğim?

Yüksek erişilebilirlik için Redis'in dağıtık hizmetlerde lider seçimini nasıl kolaylaştırabileceğini keşfedin. Redis Caching & Messaging (Pub/Sub, Streams) ile uygulamalı kodu tarayıcıda doğrudan çalıştırarak pratik yaparsın ve 7/24 yapay zeka koçu dersi çalışırken sorularını yanıtlar.

Redis Caching & Messaging (Pub/Sub, Streams) öğrenmeye başlamak için deneyim gerekli mi?

Önceden deneyim gerekmez. CoddyKit'te Redis Caching & Messaging (Pub/Sub, Streams), başlangıçtan ileri seviyeye kadar yapılandırıldığı için buradan başlayabilir veya başından başlayıp kendi hızında ilerleme yapabilirsin. Bu, 4 dersinin 2. dersidir.

“Lider Seçimi Kalıpları” dersi ne kadar sürer?

Çoğu CoddyKit dersi yaklaşık 5–10 dakika sürer. Her biri kısa ve etkileşimli olduğu için sabit ilerleme yaparsın ve web ile uygulama arasında tam olarak bıraktığın yerden devam edebilirsin.

Bu Redis Caching & Messaging (Pub/Sub, Streams) dersinde kod yazıp çalıştırabilir miyim?

Evet. Her Redis Caching & Messaging (Pub/Sub, Streams) dersi yerleşik bir kod editörü içerir, bu sayede tarayıcıda gerçek kod yazıp çalıştırabilir ve anlık yapay zeka geri bildirimi alırsın — yerel kurulum gerekli değildir.

Bu kursun tüm dersleri

  1. Redis ile Dağıtık Kilitler
  2. Lider Seçimi Kalıpları
  3. Koordinasyon Hizmeti Olarak Redis
  4. Dağıtık Hız Sınırlama
← Redis Caching & Messaging (Pub/Sub, Streams) Sayfasına Dön