A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solution for determining, before run-time, the degree of fault tolerance allowed in the system. This analysis will allow the system designer to verifL f a l l the tasks in the system meet their deadlines and to decide which optional parts must be discarded if some deadlines would be missed. The identification of feasible options thatdoi:10.1109/rtcsa.2000.896408 dblp:conf/rtcsa/Mejia-AlvarezAMM00 fatcat:3bdqswiaenedfbsdwewjxeb6ne