Plate III · Filed under
Reliability
Reliability
11 entries
- 001
Jev calibration: why three confident decisions make one unreliable pipeline
Each gate is right 90% of the time. Chain three and the failures do not spread out, they pile onto the same inputs. What correlation does to a pipeline.
JevAIReliabilityDistributed Systems - 002
Jev benchmarked on 5,574 real messages: accuracy, calibration and where it fails
No fine tuning, no examples, two labels and one endpoint. 98.73% accurate, and every confidence bucket turned out more right than it claimed to be.
JevAIPerformanceBackend - 003
Transactional outbox pattern: events that never go missing
Write to the database, then publish to Kafka, and one of them will eventually fail. How an outbox table makes the write and the event a single commit.
Distributed SystemsPostgreSQLReliabilityBackend - 004
Postgres as a job queue with SELECT FOR UPDATE SKIP LOCKED
You do not need a second system for background jobs. How SKIP LOCKED turns a table into a queue, and the details that decide whether it holds up.
PostgreSQLDatabasesBackendQueues - 005
Kafka consumer lag: the only metric that tells you the truth
Throughput says how fast you are. Lag says whether you are keeping up. Why lag climbs, why adding consumers stops helping, and why rebalances make it worse.
KafkaMessagingDistributed SystemsBackend - 006
Database connection pool sizing: a pool is a queue with a depth
Every request waits in line for a connection. Little's law says how long the line is, why a bigger pool makes it slower, and how exhaustion cascades.
PostgreSQLBackendPerformanceReliability - 007
Clock skew: why timestamps cannot order events across servers
Two servers never agree on the time, so the one running behind overwrites the one ahead. What each clock is for, and what to sequence with instead.
Distributed SystemsBackendReliabilityTimekeeping - 008
Backpressure: when the consumer is slower than the producer
An unbounded buffer does not fix a speed mismatch, it postpones the crash. Bounded queues, blocking sends and early rejection, and where each one belongs.
BackendDistributed SystemsReliabilityPerformance - 009
Idempotency keys: how to stop a retry double charging
A timeout never tells you whether the write landed. How an idempotency key settles it, and why the key has to commit in the same transaction as the work.
API DesignIdempotencyReliabilityBackend - 010
Retry storms: exponential backoff, jitter and retry budgets
How synchronised retry waves form, why exponential backoff alone does not prevent them, and what a retry budget buys you that a retry count cannot.
Distributed SystemsReliabilityBackendRetries - 011
Deadline propagation: why chained timeouts add up
A timeout is a per-hop constant. A deadline is a budget the whole request shares. Why a chain of three-second timeouts lets a request run for nine.
Distributed SystemsBackendReliabilityTimeouts