liveBook · Manning

Availability

As explained in The Coder Cafe

High availability is the property of a system remaining operational and accessible more often than an equivalent single-node system.

Uptime describes how often a system remains operational. High availability is often used for a system that stays available more often than an equivalent single node. But a high uptime percentage alone does not tell users whether requests succeed quickly enough to be useful. section 6.10.2 section 6.10.1

Availability needs a request-level meaning. Under the CAP theorem, an available system returns a non-error response to every request, though the data may not be current. That definition has no response-time limit: a response arriving an hour later could qualify technically while being useless in practice. PACELC adds latency to the design trade-off, including when there is no network partition. section 6.2 section 6.10.1 section 6.3

Why the percentage needs context

Suppose an SLA promises 50% uptime and a database achieves 80%. It exceeds the promise, but calling it highly available would be misleading. Likewise, five nodes that are each available half the time might achieve roughly 80% write availability with a write quorum of two. That still leaves about one write request in five without a successful response. section 6.10.2

When evaluating an uptime claim, ask what counts as a successful request, how quickly it must complete, and what happens during a network partition. A system may preserve availability during a partition by returning older data; another may preserve consistency and reject some requests. Neither an uptime figure nor the phrase “high availability” settles those trade-offs. section 6.2 section 6.3 section 6.10.2

How The Coder Cafe covers it

How deep it goes
Defines a practical comparison, then tests its limits with SLA and quorum examples; gives no universal uptime threshold.
Examples
Contrasts an 80% uptime result against a 50% SLA and roughly 80% write availability from five nodes.
What it assumes
Defines availability through request responses while using database nodes, SLAs, and write quorums as examples.
What you can do after
Evaluate/understand high-availability claims by checking the single-node baseline, successful-request rate, and response time.
How it connects
Connects uptime to availability, latency, service-level agreements, write quorums, CAP, and PACELC.

Also explained in

Compare how 25 books explain availability →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of The Coder Cafe. The section links point to the parts of the book it draws on.