Erlang OTP: Distributed & Fault-Tolerant Systems Programming · 课时

面向高可用性进行设计

应用高级 OTP 原则，设计并实现能够承受故障且保持运行的高可用服务。

面向高可用性进行设计 是 CoddyKit 上的免费 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 课时。这是第 1 节课，共 4 节。你可以在下方免费阅读本课时的完整内容 — 然后在浏览器中使用内置代码编辑器和全天候 AI 导师进行实践。这是 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 学习路径的一部分，你的进度在网页和 CoddyKit 应用中同步。 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 课程共包含 4 节课。

本课时的部分内容尚未翻译，以英文显示。

High Availability: Always On

What is High Availability (HA)? It's about designing systems that keep running even when parts fail. Erlang and OTP are built from the ground up to achieve this.

Imagine a critical service like an online store. If it goes down, sales are lost! HA aims to minimize downtime, ensuring your application remains operational and accessible to users.

Core HA Design Pillars

Achieving High Availability relies on several key design principles:

Redundancy: Having multiple components capable of performing the same task.
Fault Tolerance: The ability to continue operating despite failures.
Automatic Recovery: Systems that detect failures and recover or switch automatically.
No Single Point of Failure (SPOF): Eliminating any component whose failure would bring down the entire system.

Active-Passive Redundancy

The Active-Passive pattern, also known as Hot Standby, involves one primary (active) component and one or more secondary (passive) components.

The active component handles all requests. If it fails, a passive component takes over, becoming the new active. This provides redundancy and minimizes downtime, but the passive component is idle until needed.

Simulating Active-Passive in Erlang

We can simulate an active-passive setup using Erlang processes and monitors. Here, a 'standby' process monitors a 'primary'. If the primary dies, the standby takes over. This is a simplified example of role switching.

Try running this code:

-module(ha_example).
-export([start/0, init/0, primary_loop/0, standby_loop/0]).

start() ->
    Pid = spawn(?MODULE, init, []),
    io:format("Started HA example with ~p~n", [Pid]),
    Pid.

init() ->
    % Simulate starting a primary and a standby
    PrimaryPid = spawn(?MODULE, primary_loop, []),
    StandbyPid = spawn(?MODULE, standby_loop, []),
    io:format("Primary started: ~p~n", [PrimaryPid]),
    io:format("Standby started: ~p~n", [StandbyPid]),

    % Standby monitors Primary to detect its failure
    monitor(process, PrimaryPid),

    % Keep the init process alive to show output
    receive
        _ -> ok
    end.

primary_loop() ->
    io:format("Primary is active and processing requests...~n"),
    timer:sleep(5000), % Simulate work
    io:format("Primary is going down!~n"),
    exit(primary_failure). % Primary fails

standby_loop() ->
    receive
        {'DOWN', _MonitorRef, process, _Pid, _Reason} ->
            io:format("Standby detected Primary failure! Taking over...~n"),
            % In a real system, the standby would now become active
            % and potentially start its own workers or re-register globally.
            become_active()
    end.

become_active() ->
    io:format("Standby is now the new Active!~n"),
    % A real active process would now enter its main loop to handle requests
    timer:sleep(infinity).

Active-Active for Scalability

In an Active-Active pattern, multiple components are simultaneously active, sharing the workload. This offers both redundancy and improved scalability by distributing tasks.

If one active component fails, the others continue processing requests, often with a slight performance degradation. This setup requires careful state management and load balancing to ensure requests are distributed efficiently.

State Replication in HA Systems

A major challenge in HA is maintaining consistent state across redundant components. If an active component fails, its replacement needs access to the most up-to-date information.

Strategies include:

Replication: Copying state changes to standby or other active components (e.g., using Mnesia or custom replication logic).
Shared Storage: Storing state in a highly available external database accessible by all nodes.
Stateless Design: Making components stateless, so any instance can handle any request without needing prior state.

Eliminating Single Points of Failure

A Single Point of Failure (SPOF) is any part of a system whose failure would stop the entire system from working. Identifying and eliminating SPOFs is crucial for HA.

Common SPOFs include:

A single database server.
A single network switch.
A central coordinator process without a backup.

Design your system with redundancy at every critical layer, from hardware to software components.

Liveness: Heartbeats & Health Checks

To enable automatic recovery and failover, components need a way to detect if others are still alive and healthy. This is done through heartbeating and health checks.

Processes can send periodic "I'm alive" messages.
Monitors can detect process crashes immediately (as seen in our example).
Nodes can monitor other nodes using net_kernel:monitor_nodes/1 for cluster-wide health.

Electing a Leader in a Cluster

Sometimes, even in an active-active system, a single coordinator or "leader" is needed to manage a shared resource or ensure global consistency. If this leader fails, a new one must be chosen.

Leader Election is the process of dynamically selecting a new leader from a set of potential candidates in a distributed system. Erlang's global module can help with simple global registration, but for robust election algorithms, custom solutions or libraries are often used.

HA Design Principles Check

Consider a critical Erlang service designed for high availability.

HA Design: Key Takeaways

We've explored how to design highly available Erlang OTP systems:

Understood the pillars: redundancy, fault tolerance, automatic recovery, and no SPOF.
Examined Active-Passive and Active-Active patterns.
Discussed state replication and consistency.
Learned about heartbeating and leader election concepts.

By applying these advanced OTP principles, you can build robust, resilient applications that remain operational even in the face of failures.

常见问题解答

「面向高可用性进行设计」课时是免费的吗？

是的 — 「面向高可用性进行设计」的完整文本可在网页上免费阅读。要进行交互式练习（内置代码编辑器和全天候 AI 导师）并解锁 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 课程的其余内容，请升级到 CoddyKit PRO。 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 课程共包含 4 节课。

「面向高可用性进行设计」这节课中我会学到什么？

应用高级 OTP 原则，设计并实现能够承受故障且保持运行的高可用服务。你通过在浏览器中直接运行的动手代码来练习 Erlang OTP: Distributed & Fault-Tolerant Systems Programming，全天候 AI 导师会在你学习这节课的过程中回答你的问题。

学习 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 需要有经验吗？

无需任何先前经验。CoddyKit 上的 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 课程适合初学者到高级学习者，你可以从这里开始或从头开始，按照自己的节奏学习。这是第 1 节课，共 4 节。

「面向高可用性进行设计」课时需要多长时间？

大多数 CoddyKit 课程大约需要 5–10 分钟。每节课都很精短且互动，所以你能稳步进步，并在网页和应用中从离开的地方继续。

我能在这节 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 课中编写并运行代码吗？

能。每节 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 课都包含内置代码编辑器，你可以在浏览器中直接编写并运行真实代码，并获得即时 AI 反馈 — 无需本地设置。

此课程中的所有课时

← 返回 Erlang OTP: Distributed & Fault-Tolerant Systems Programming