Imprecise Computation Model, synchronous periodic real-time task sets and total weighted error

In this paper an analysis of Imprecise Computation Model with respect to synchronous periodic, real-time task sets is given. In the analysis earliest deadline first (EDF) and rate monotonic (RM) scheduling algorithms for mandatory subtask sets are assumed. Two different approaches are considered. In the first approach the mandatory subtask set is modified in a way that mandatory execution times are extended. In the second approach the mandatory and the optional subtask sets are separately scheduled. The solution which minimizes the total weighted error is given for both cases. The single preemptive processor system is assumed.