Erlang OTP: Distributed & Fault-Tolerant Systems Programming · 강의

고가용성을 위한 설계

고급 OTP 원칙을 적용하여 장애를 견디고 계속 작동할 수 있는 고가용성 서비스를 설계하고 구현합니다.

고가용성을 위한 설계은(는) CoddyKit의 무료 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 강의입니다. 이것은 4개 중 1번째 강의입니다. 아래에서 전체 강의를 무료로 읽을 수 있으며, 내장 코드 에디터와 24/7 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.

자주 묻는 질문

“고가용성을 위한 설계” 강의는 무료인가요?

네 — “고가용성을 위한 설계” 전체 내용을 이 웹사이트에서 무료로 읽을 수 있습니다. 인터랙티브하게 실습하려면(내장 코드 에디터와 24/7 AI 튜터), CoddyKit PRO로 업그레이드하면 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 강의 전체를 잠금 해제할 수 있습니다. Erlang OTP: Distributed & Fault-Tolerant Systems Programming 강의에는 총 4개의 강의가 포함되어 있습니다.

“고가용성을 위한 설계”에서 뭘 배우나요?

고급 OTP 원칙을 적용하여 장애를 견디고 계속 작동할 수 있는 고가용성 서비스를 설계하고 구현합니다. 브라우저에서 직접 실행하는 실습 코드로 Erlang OTP: Distributed & Fault-Tolerant Systems Programming을(를) 배우며, 24/7 AI 튜터가 강의를 진행하면서 질문에 답변해줍니다.

Erlang OTP: Distributed & Fault-Tolerant Systems Programming을(를) 시작하는 데 경험이 필요한가요?

사전 경험은 필요하지 않습니다. CoddyKit의 Erlang OTP: Distributed & Fault-Tolerant Systems Programming은(는) 초급자부터 고급 학습자까지를 위해 구성되어 있으므로, 여기서 시작하거나 처음부터 시작할 수 있으며 자신의 속도대로 진행할 수 있습니다. 이것은 4개 중 1번째 강의입니다.

“고가용성을 위한 설계” 강의는 얼마나 걸리나요?

대부분의 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(으)로 돌아가기