Performance evaluation of on-line scheduling algorithms for imprecise computation

This paper presents an algorithm for scheduling imprecise tasks to minimize maximum error and analyzes its performance through intensive simulation. The imprecise computation is used to manage transient overload of computation. Each task for imprecise systems consists of a mandatory part and an optional part that can be skipped when systems are overloaded. The imprecise computation trades accuracy for meeting the deadline of tasks by skipping their optional parts. To increase accuracy for imprecise computation, we present a simple on-line scheduling algorithm that minimizes the maximum error. This algorithm executes mandatory parts of tasks first, then the optional parts in order to minimize maximum error. The proposed algorithm also increases schedulability by executing mandatory parts first. The proposed algorithm is simple and does not require any additional data structures such as the reservation list for maintaining mandatory parts.

[1]  Riccardo Bettati,et al.  Imprecise computations , 1994, Proc. IEEE.

[2]  Wei-Kuan Shih,et al.  Algorithms for Scheduling Imprecise Computations with Timing Constraints to Minimize Maximum Error , 1995, IEEE Trans. Computers.

[3]  Won Ryu,et al.  On-line scheduling algorithms for reducing the largest weighted error incurred by imprecise tasks , 1998, Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236).

[4]  Riccardo Bettati.  On-Line Scheduling for Checkpointing Imprecise Computation , 1993, Fifth Euromicro Workshop on Real-Time Systems.

[5]  Joseph Y.-T. Leung,et al.  Minimizing Maximum Weighted Error for Imprecise Computation Tasks , 1994, J. Algorithms.

[6]  Wei-Kuan Shih,et al.  On-line scheduling of imprecise computations to minimize error , 1992, [1992] Proceedings Real-Time Systems Symposium.