Modèles d’élection d’un coordinateur
Découvrez comment Redis peut faciliter l’élection d’un coordinateur dans des services distribués afin d’assurer la haute disponibilité.
Modèles d’élection d’un coordinateur est une leçon Redis Caching & Messaging (Pub/Sub, Streams) gratuite sur CoddyKit. Ceci est la leçon 2 sur 4. Tu peux lire la leçon complète ci-dessous gratuitement — puis la pratiquer en direct dans le navigateur avec un éditeur de code intégré et un tuteur IA 24/7. Elle fait partie du parcours d'apprentissage Redis Caching & Messaging (Pub/Sub, Streams), et ta progression se synchronise sur le web et l'application CoddyKit. Le cours Redis Caching & Messaging (Pub/Sub, Streams) comprend 4 leçons au total.
Certaines parties de cette leçon n'ont pas encore été traduites et s'affichent en anglais.
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
SETNXorSET ... NX EXexecute 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:
- Process A calls
SETNX LEADER_KEY process_A. It succeeds (returns1). - 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 (likeSETNX).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.
Apprends Redis Caching & Messaging (Pub/Sub, Streams) avec un tuteur IA — gratuit
Écris et exécute du vrai code dans ton navigateur, obtiens de l'aide instantanée d'un tuteur IA disponible 24h/24, et reprends là où tu t'es arrêté sur le web ou dans l'app.
- Cours
- 12
- Leçons
- 48
Questions Fréquemment Posées
La leçon « Modèles d’élection d’un coordinateur » est-elle gratuite ?
Oui — le texte complet de « Modèles d’élection d’un coordinateur » est gratuit à lire ici sur le web. Pour la pratiquer de manière interactive (un éditeur de code intégré et un tuteur IA 24/7) et déverrouiller le reste du cours Redis Caching & Messaging (Pub/Sub, Streams), passe à CoddyKit PRO. Le cours Redis Caching & Messaging (Pub/Sub, Streams) comprend 4 leçons au total.
Qu'est-ce que j'apprendrai dans « Modèles d’élection d’un coordinateur » ?
Découvrez comment Redis peut faciliter l’élection d’un coordinateur dans des services distribués afin d’assurer la haute disponibilité. Tu pratiques Redis Caching & Messaging (Pub/Sub, Streams) avec du code pratique que tu exécutes directement dans le navigateur, et un tuteur IA 24/7 répond à tes questions au fur et à mesure que tu avances dans la leçon.
Dois-je avoir de l'expérience pour commencer Redis Caching & Messaging (Pub/Sub, Streams) ?
Aucune expérience préalable n'est requise. Redis Caching & Messaging (Pub/Sub, Streams) sur CoddyKit est structuré pour les débutants jusqu'aux apprenants avancés, donc tu peux commencer ici ou depuis le début et avancer à ton rythme. Ceci est la leçon 2 sur 4.
Combien de temps prend la leçon « Modèles d’élection d’un coordinateur » ?
La plupart des leçons CoddyKit prennent environ 5–10 minutes. Chacune est courte et interactive, tu progresses régulièrement et tu repiques exactement où tu t'es arrêté sur le web et l'app.
Peux-tu écrire et exécuter du code dans cette leçon Redis Caching & Messaging (Pub/Sub, Streams) ?
Oui. Chaque leçon Redis Caching & Messaging (Pub/Sub, Streams) inclut un éditeur de code intégré, tu écris et exécutes du vrai code directement dans ton navigateur et tu reçois des retours IA instantanés — aucune configuration locale requise.
Toutes les leçons de ce cours
- Verrous distribués avec Redis
- Modèles d’élection d’un coordinateur
- Redis comme service de coordination
- Limitation de débit distribuée