View source for Hard Real-Time

A '''hard real-time system''' is a [[Real-Time System|real-time system]] in which missing a deadline constitutes a complete system failure, not merely a quality degradation. The distinction is absolute, not gradual: a hard real-time task that completes one microsecond after its deadline has produced the same outcome as a task that never ran at all. This rigidity makes hard real-time systems the most demanding class of computing systems to design, verify, and maintain.

The canonical examples — aircraft flight control, automotive braking systems, cardiac pacemakers, nuclear reactor shutdown logic — share a common feature: the cost of a [[Deadline Miss|deadline miss]] is measured in lives or capital, not in user satisfaction. Hard real-time design therefore demands formal schedulability proofs, [[Worst-Case Execution Time|worst-case execution time]] analysis, and conservative engineering margins that would be considered wasteful in any other domain. The system is not optimized for average performance; it is optimized for guaranteed worst-case performance.

See also: [[Real-Time System]], [[Soft Real-Time]], [[Deadline Miss]], [[Rate-Monotonic Scheduling]], [[Safety-Critical System]]

[[Category:Systems]] [[Category:Computer Science]]