Deterministic scheduling is a task-scheduling approach in which the order and timing of task execution are fully predictable given the same inputs, so that worst-case latency and execution order can be guaranteed in advance. It is a defining requirement of real-time computing and real-time operating systems, which must bound task response times to meet hard or soft deadlines. Deterministic scheduling contrasts with best-effort scheduling, which optimises average throughput without timing guarantees.