Q12Real Time Systems

A Real-Time System is not defined by its sheer processor speed; a 100 MHz microcontroller can be a perfect RTS, while a 5 GHz gaming PC is a horrific one. An RTS is defined by its absolute mathematical predictability.

• 1. Absolute Determinism: This is the foundational law. The system must mathematically guarantee that for a specific input, the exact same output will be produced in the exact same physical timeframe, every single time, without exception. Random latency spikes are mathematically forbidden.
• 2. Strict Timing Constraints (Deadlines): The system architecture is ruled by the clock. Computations are completely worthless if they execute past the rigid deadline. The OS must violently enforce these temporal boundaries above all other constraints.
• 3. Microscopic Interrupt Latency: When a physical hardware event occurs (e.g., a radar detects an incoming missile), the CPU must physically halt its current task and execute the Interrupt Service Routine (ISR). In an RTS, this latency must be mathematically bounded to a few microseconds, whereas a desktop OS might randomly block interrupts for milliseconds.
• 4. Preemptive Priority-Based Scheduling: The OS must act as a violent dictator. If a low-priority task is running and a high-priority task becomes ready, the OS must instantly, preemptively rip the CPU away from the low-priority task and hand it to the critical task.
• 5. Catastrophic Fault Tolerance: Because many RTS control lethal physical machinery (nuclear reactors, fly-by-wire aircraft), the architecture must include massive hardware and software redundancy. It must mathematically guarantee safe degradation if a primary CPU physically catches fire.