| 1 |
That's nearly perfect James - a really quick overview on tons of papers. Thanks. |
| 2 |
|
| 3 |
What do you think of probabilistic theory and system/OS controllable |
| 4 |
scheduling of sequential/parallel execution (actually fault tolerant) |
| 5 |
where instead of check pointing it relies on voting of SM responses, |
| 6 |
where a whole application is divided on several |
| 7 |
functionality-completed SMs; and missed deadlines of application parts |
| 8 |
are just a subset of covered faults (most of its faulty semantic |
| 9 |
hardened up to timing and/or crash failure semantics). |
| 10 |
As a result, it achieves a predictable HRT with a given reliability. |
| 11 |
|
| 12 |
rgs, alex |
| 13 |
-- |
| 14 |
gentoo-embedded@g.o mailing list |
Archives