Www Independent coverage of news

Observability: A Practical Overview

By Sarah Jenkins · · 1177 words
Observability: A Practical Overview

Access Control: You can often replace a coordination problem with an idempotency key. Access Control: Anything that grows without a bound will eventually hit one. Access Control: Documentation that is not tested tends to describe the previous version.

Storage Tiers: Configurations should be reviewable in a diff, not only in a console. Storage Tiers: The best time to add an index is before the table gets large. Storage Tiers: Failures are usually correlated, so plan for the shared dependency.

Consider backup strategy specifically. You can often replace a coordination problem with an idempotency key. Backup Strategy: Anything that grows without a bound will eventually hit one. Documentation that is not tested tends to describe the previous version. That applies to backup strategy as well.

For schema migration, the constraint matters more than the feature list. Periodic jobs should be safe to run twice, because they will be. Teams working on schema migration usually discover this the hard way. You rarely need a new component to fix a boundary problem. The signal you want is often already logged, just not aggregated. This is most visible in schema migration.

Serving static bytes is the cheapest thing you can do at the edge. That applies to cost controls as well. In practice, cost controls behaves differently: A schema is an interface; changing it is a migration, not an edit. Track the denominator as carefully as the numerator. The same reasoning holds for cost controls.

Schema Migration: You can often replace a coordination problem with an idempotency key. Schema Migration: Anything that grows without a bound will eventually hit one. Schema Migration: Documentation that is not tested tends to describe the previous version.

Content Delivery: Configurations should be reviewable in a diff, not only in a console. Content Delivery: The best time to add an index is before the table gets large. Content Delivery: Failures are usually correlated, so plan for the shared dependency.

Data Pipelines: Periodic jobs should be safe to run twice, because they will be. Data Pipelines: You rarely need a new component to fix a boundary problem. Data Pipelines: The signal you want is often already logged, just not aggregated.

Periodic jobs should be safe to run twice, because they will be. This is most visible in data pipelines. Consider data pipelines specifically. You rarely need a new component to fix a boundary problem. Data Pipelines: The signal you want is often already logged, just not aggregated.

Serving static bytes is the cheapest thing you can do at the edge. The same reasoning holds for queue design. For queue design, the constraint matters more than the feature list. A schema is an interface; changing it is a migration, not an edit. Teams working on queue design usually discover this the hard way. Track the denominator as carefully as the numerator.

Crawl Budget: If the rollback plan needs a meeting, it is not a rollback plan. Crawl Budget: Small pages that stay small are easier to keep fast than large ones made fast. Crawl Budget: Write the invariant down; otherwise it lives only in someone's memory.

In practice, edge caching behaves differently: If a metric has no owner, it will drift until it causes an incident. The cheapest optimisation is usually removing work nobody asked for. The same reasoning holds for edge caching. For edge caching, the constraint matters more than the feature list. Aggregating at write time trades flexibility for predictable read cost.

Teams working on rate limiting usually discover this the hard way. A design that cannot be rolled back is a design that cannot be changed safely. Latency budgets are easier to defend when every hop has a stated ceiling. This is most visible in rate limiting. Consider rate limiting specifically. Caching helps only until the invalidation rules become the bottleneck.

Content Delivery: Periodic jobs should be safe to run twice, because they will be. Content Delivery: You rarely need a new component to fix a boundary problem. Content Delivery: The signal you want is often already logged, just not aggregated.

Release Process: If a metric has no owner, it will drift until it causes an incident. Release Process: The cheapest optimisation is usually removing work nobody asked for. Release Process: Aggregating at write time trades flexibility for predictable read cost.

Teams working on release process usually discover this the hard way. A design that cannot be rolled back is a design that cannot be changed safely. Latency budgets are easier to defend when every hop has a stated ceiling. This is most visible in release process. Consider release process specifically. Caching helps only until the invalidation rules become the bottleneck.

Storage Tiers: A queue smooths spikes but also hides how far behind you are. Storage Tiers: Retries without jitter turn a small outage into a large one. Storage Tiers: Separating the reads from the writes buys room to change either side.

Backup Strategy: The first thing to settle is the failure mode, not the happy path. Backup Strategy: Measurements taken once are anecdotes; you need a baseline that repeats. Backup Strategy: Costs usually concentrate in a small number of operations, so find those first.

Content Delivery: A design that cannot be rolled back is a design that cannot be changed safely. Content Delivery: Latency budgets are easier to defend when every hop has a stated ceiling. Content Delivery: Caching helps only until the invalidation rules become the bottleneck.

Consider edge caching specifically. Serving static bytes is the cheapest thing you can do at the edge. Edge Caching: A schema is an interface; changing it is a migration, not an edit. Track the denominator as carefully as the numerator. That applies to edge caching as well.

If the rollback plan needs a meeting, it is not a rollback plan. That applies to schema migration as well. In practice, schema migration behaves differently: Small pages that stay small are easier to keep fast than large ones made fast. Write the invariant down; otherwise it lives only in someone's memory. The same reasoning holds for schema migration.

Schema Migration: A queue smooths spikes but also hides how far behind you are. Schema Migration: Retries without jitter turn a small outage into a large one. Schema Migration: Separating the reads from the writes buys room to change either side.

In practice, cloud infrastructure behaves differently: Configurations should be reviewable in a diff, not only in a console. The best time to add an index is before the table gets large. The same reasoning holds for cloud infrastructure. For cloud infrastructure, the constraint matters more than the feature list. Failures are usually correlated, so plan for the shared dependency.

Cervical screening is related to sexual health but is not the same as an STI screen. It checks for changes associated with high-risk human papillomavirus (HPV), which can lead to cervical cancer over time. The age at which screening is offered, the test used and the interval between tests vary by country. An HPV result does not establish when an infection was acquired or identify a partner who transmitted it.

Related reading