Reducibility
Glossary Contents
← Ch XVIII
Chapter XIX Job Sequencing
Ch XX →
  1. 55 — Deadlines on a single machine
  2. 56 — Moore–Hodgson in Ada
  3. 57 — Avionics task scheduling
57

Avionics task scheduling

In a fly-by-wire system, the flight-control task missing a deadline is not a customer complaint — it is a crash.

On a Boeing 787 or an Airbus A380, the flight-control computer runs dozens of tasks at varying frequencies — flight-surface control at 100 Hz, autopilot at 50 Hz, displays at 20 Hz, mission planning at 1 Hz. The scheduler (typically rate-monotonic or earliest-deadline-first) must guarantee every hard-deadline task finishes on time. That is job sequencing with hard deadlines and infinite penalty for misses. Ada's Ravenscar profile, used in most safety-critical avionics, was designed to make these scheduling guarantees provable. Lockheed Martin, Honeywell, and Thales all ship Ada-based flight software for exactly this reason. The same problem also runs manufacturing lines (jobs through a single bottleneck machine), emergency-room triage (patients as jobs, priority and length varying), and batch scheduler infrastructure.

In plain terms

An airplane's computer has many things to do, all the time, and each has a deadline. If the autopilot calculation is late, the plane wobbles. The scheduler decides what to compute next, and if it's smart enough, no deadline is ever missed. Job sequencing is the math behind that decision.

Scan to come back to page 57

End of Chapter XIX
Chapter XX Partition →
← 56 Moore–Hodgson in Ada
3/3 · 57/63
58 Two equal piles →