This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Algorithms for Scheduling Imprecise Computations with Timing Constraints to Minimize Maximum Error
March 1995 (vol. 44 no. 3)
pp. 466-471

Abstract—We consider here the problem of scheduling tasks in the imprecise computation model to minimize the maximum error. Given a task system and a schedule of it, the maximum error of the task system is equal to the error of the task that has the largest error when the task system is executed according to the schedule. We describe two preemptive algorithms for scheduling on a processor n dependent tasks with rational ready times, deadlines, and processing times. Each schedule found by our algorithms is an optimal schedule with the minimum total error, and according to this schedule the maximum error is minimized. The run times of our algorithms are O(n3) and O(n2).

[1] J.W.S. Liu,K.J. Lin,, and S. Natarajan,“Scheduling Real-Time, Periodic Jobs Using Imprecise Results,” Proceedings of the IEEE 8th Real-Time Systems Symposium,San Jose, California, December 1987.
[2] J.Y. Chung,J.W.S. Liu,, and K.J. Lin,“Scheduling Periodic Jobs That Allows Imprecise Results,” IEEE Transactions on Computers, vol.19, no. 9, pp. 1156-1173, September 1990.
[3] J.W.S. Liu,K.J. Lin,W.K. Shih,J.Y. Chung,A. Yu,, and W. Zhao,“Algorithms for Scheduling Imprecise Computations,” IEEE Computer, pp. 58-68, May 1991.
[4] W.K. Shih,J.W.S. Liu,, and J.Y. Chung,“Fast Algorithms for Scheduling Imprecise Computations,” SIAM J. on Computing, vol. 20, no. 3, July 1991.

Index Terms:
Real-time systems, scheduling to meet deadlines, deterministic scheduling.
Citation:
Jane W.S. Liu, Wei-Kuan Shih, "Algorithms for Scheduling Imprecise Computations with Timing Constraints to Minimize Maximum Error," IEEE Transactions on Computers, vol. 44, no. 3, pp. 466-471, March 1995, doi:10.1109/12.372040
Usage of this product signifies your acceptance of the Terms of Use.