Scheduling algorithm for real-time imprecise computations to minimise maximum weighted errors using the linear programming method
An optimal scheduling algorithm for imprecise systems is presented. The proposed algorithm aims at minimising the maximum weighted errors. A novel property of the algorithm is that the errors are evenly distributed among scheduled tasks. The complexity of the proposed algorithm is O(N3) in the worst case, where N is the number of tasks.