4 ms·
In hard realtime systems, the problem is not "we have enough time to do the computation" but "we can prove the computation will run in the available time". The
by diroussel 7y ago
In hard realtime systems, the problem is not "we have enough time to do the computation" but "we can prove the computation will run in the available time".
The complexity in modern mulit user operating systems (many processes, a run queue, spin locks) along with modern processors (multi tier memory architecture, micro-code, branch prediction, long stalls for memory access) mean it's very hard to prove that anything will run in finite time.
- SAI_Peregrinus 7y agoIMO the terms "hard realtime" and "soft realtime" are unnecessarily confusing to beginners. I think that "deterministically bounded latency" and "probabilistically bounded latency" are more descriptive. But they're long and difficult to type, so we'd inevitably call them DBL and PBL, and be back at confusion.