Erlang OTP: Distributed & Fault-Tolerant Systems Programming · Pelajaran

Merancang Ketersediaan Tinggi

Terapkan prinsip-prinsip OTP tingkat lanjut untuk merancang dan menerapkan layanan dengan ketersediaan tinggi yang mampu menghadapi kegagalan dan tetap beroperasi.

Pelajaran 1 dari 411 langkah

Merancang Ketersediaan Tinggi adalah pelajaran Erlang OTP: Distributed & Fault-Tolerant Systems Programming gratis di CoddyKit. Ini adalah pelajaran 1 dari 4. Kamu bisa membaca pelajaran lengkapnya di bawah secara gratis — lalu praktikkan langsung di browser dengan editor kode bawaan dan tutor AI 24/7. Ini adalah bagian dari jalur belajar Erlang OTP: Distributed & Fault-Tolerant Systems Programming, dan progresmu tersinkronisasi di web dan aplikasi CoddyKit. Kursus Erlang OTP: Distributed & Fault-Tolerant Systems Programming mencakup 4 pelajaran total.

Bagian dari pelajaran ini belum diterjemahkan dan ditampilkan dalam bahasa Inggris.

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.

Gratis untuk memulai

Belajar Erlang dengan tutor AI — gratis

Tulis dan jalankan kode asli di browser kamu, dapatkan bantuan instan dari tutor AI 24/7, dan lanjutkan di mana kamu tinggalkan di web atau aplikasi.

Kursus
12
Pelajaran
48

Pertanyaan yang Sering Diajukan

Apakah pelajaran “Merancang Ketersediaan Tinggi” gratis?

Ya — teks lengkap “Merancang Ketersediaan Tinggi” gratis dibaca di sini di web. Untuk praktiknya secara interaktif (editor kode bawaan dan tutor AI 24/7) dan buka sisa kursus Erlang OTP: Distributed & Fault-Tolerant Systems Programming, upgrade ke CoddyKit PRO. Kursus Erlang OTP: Distributed & Fault-Tolerant Systems Programming mencakup 4 pelajaran total.

Apa yang akan aku pelajari di “Merancang Ketersediaan Tinggi”?

Terapkan prinsip-prinsip OTP tingkat lanjut untuk merancang dan menerapkan layanan dengan ketersediaan tinggi yang mampu menghadapi kegagalan dan tetap beroperasi. Kamu berlatih Erlang OTP: Distributed & Fault-Tolerant Systems Programming dengan kode praktik yang langsung kamu jalankan di browser, dan tutor AI 24/7 menjawab pertanyaanmu saat kamu mengerjakan pelajaran ini.

Apakah aku perlu pengalaman untuk memulai Erlang OTP: Distributed & Fault-Tolerant Systems Programming?

Tidak diperlukan pengalaman sebelumnya. Erlang OTP: Distributed & Fault-Tolerant Systems Programming di CoddyKit dirancang untuk pemula hingga pelajar tingkat lanjut, jadi kamu bisa memulai di sini atau dari awal dan belajar sesuai kecepatan kamu sendiri. Ini adalah pelajaran 1 dari 4.

Berapa lama pelajaran “Merancang Ketersediaan Tinggi” memakan waktu?

Sebagian besar pelajaran CoddyKit memakan waktu sekitar 5–10 menit. Setiap pelajaran ringkas dan interaktif, jadi kamu membuat kemajuan stabil dan melanjutkan dari tempat kamu tinggalkan di web dan aplikasi.

Bisakah aku menulis dan menjalankan kode dalam pelajaran Erlang OTP: Distributed & Fault-Tolerant Systems Programming ini?

Ya. Setiap pelajaran Erlang OTP: Distributed & Fault-Tolerant Systems Programming menyertakan editor kode bawaan, jadi kamu menulis dan menjalankan kode nyata langsung di browser dan mendapatkan umpan balik AI instan — tidak diperlukan penyiapan lokal.

Semua pelajaran dalam kursus ini

  1. Merancang Ketersediaan Tinggi
  2. Pola Konsensus Terdistribusi
  3. Studi Kasus Erlang OTP
  4. Pola Tekanan Balik & Pengaturan Beban
← Kembali ke Erlang OTP: Distributed & Fault-Tolerant Systems Programming