Kubernetes Scheduling Visualized: The Filter-Score Pipeline
Scheduling looks like magic until you watch the pipeline. This video walks through what happens between kubectl apply and a Pod's first container start: how the scheduler watches the API server for unscheduled Pods, filters candidate Nodes, scores them, and writes the binding. We visualize the real mechanics — node conditions, resource requests versus limits, taints and tolerations, affinity and anti-affinity, and how the kubelet's admission plays out against the schedule. Then we look at what breaks: scheduler starvation, resource fragmentation, and how preemption interacts with priorities.
Topics covered:
- The scheduler's filter-then-score pipeline
- Requests, limits, and how resources are accounted
- Taints, tolerations, affinity, and anti-affinity
- Preemption, starvation, and scheduling failures
Related articles
Kubernetes Scheduling Is a Packing Problem
How kube-scheduler bin-packs pods onto nodes with filter and score passes, why requests versus limits drive overcommit, and what QoS classes mean for eviction.
Autoscaling Is a Latency Decision
Reaction time versus provisioning time, HPA sync intervals, cooldowns, and hysteresis — why autoscaling is a latency engineering problem before it is a capacity problem.
Containers Aren't Lightweight VMs
Namespaces, cgroups, seccomp, and the real isolation boundaries — what containers actually isolate and what they don't.
More in Cloud & Infrastructure
Edge Computing Explained: Where Compute Actually Sits
What edge computing actually is — the compute tiers from device to far edge to cloud, latency and bandwidth budgets, and which workloads genuinely benefit.
DetailsContainer Orchestration Basics: API Server, Controllers, and Scheduler
Container orchestration from first principles — what the API server, controller manager, and scheduler actually do, with Kubernetes as the working example.
DetailsThe Cost of Distributed Systems: Coordination, Consistency, and Failure
What distributed systems actually cost — coordination, consistency, and failure taxes — quantified with quorum math, tail latency, and retry-storm dynamics.
DetailsDNS and Traffic Routing in the Cloud: From Resolver to Anycast
How DNS actually routes traffic in the cloud — record resolution, CDN anycast, geo routing, load balancer handoffs, and how TTLs shape your failover story.
DetailsMulti-Region Architecture: Active-Active, Failover, and Replication
The real mechanics of multi-region deployments — where writes land, how replication propagates, what failover flips, and the latency math that constrains every design.
DetailsObject Storage Under the Hood: PUT, GET, and Erasure Coding
What happens inside an object store — the PUT and GET paths, metadata partitions, erasure coding, and why object storage is eventually consistent.
DetailsAutoscaling Explained: The Controller Loop Behind Horizontal Scaling
How autoscaling actually works — the metrics window, desired-replica calculation, stabilization, and why naive CPU-based scaling oscillates under real load.
DetailsServerless Cold Starts, Measured: Where the Latency Actually Goes
Measured cold-start latency across Lambda, Cloud Functions, and container runtimes — what actually takes time and which optimizations genuinely reduce it.
DetailsContainer Images Explained: Layers, Manifests, and Digests
How container images are actually built and run — layers, manifests, content digests, and what the runtime does at pull and run time.
DetailsDepth, delivered weekly
One technical dispatch a week — articles and episode notes before they go public.
One technical dispatch per week. No noise.