Imprecise Computations

Proceedings of the IEEE

Volumn 82, Issue 1, 1994, Pages 83-94

  Liu, Jane W S ^a   Shih, Wei Kuan ^a   Lin, Kwei Jay ^b   Chung, Jen Yao ^c  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; COMPUTER ARCHITECTURE; COMPUTER OPERATING SYSTEMS; COMPUTER SYSTEM RECOVERY; CONSTRAINT THEORY; CONTROL SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING;

HARDWARE FAULT; IMPRECISE COMPUTATIONS; IMPRECISE SYSTEM; SOFTWARE FAULT; TIME CRITICAL TASK; TIMING CONSTRAINT; TIMING FAULT; TRANSIENT OVERLOAD;

REAL TIME SYSTEMS;

EID: 0028320393     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.259428     Document Type: Article

References (26)

1. J. W. S. Liu, K. J. Lin, and C. L. Liu, “A position paper for the IEEE 1987 Workshop on Real Time Operating Systems,” Cambridge, MA, May 1987.
2. K. J. Lin, S. Natarajan, and J. W. S. Liu, “Imprecise results: utilizing partial computations in real time systems,” in Proc. IEEE 8th Real Time Systems Symp. (San Jose, CA), Dec. 1987.
3. “Scheduling real time, periodic jobs using imprecise results,” in Proc. 8th Real Time Systems Symp. (San Jose, CA), Dec. 1987, pp. 252–260.
4. J. Y. Chung, J. W. S. Liu, and K. J. Lin, “Scheduling periodic jobs that allow imprecise results,” IEEE Trans. Comput., vol. 39, no. 9, pp. 11 56–1156-1174, Sept. 1990. Also J.Y. Chung, Ph.D. dissertation, Dep. of Computer Science, Univ. of Illinois, Urbana, May 1989.
5. J. W. S. Liu, K. J. Lin, W. K. Shih, A. C. Yu, J. Y. Chung, and W. Zhao, “Algorithms for scheduling imprecise computations,” IEEE Comput., pp. 58–68, May 1991.
6. J. W. S. Liu, K. J. Lin, C. L. Liu, and W. K. Shih, “Imprecise computations: a means to provide scheduling flexibility and enhance dependability,” in Readings on Real Time Systems, C. M. Krishna and Y. H. Lee, Eds. New York: IEEE PRESS, 1992.
7. S. Vrbsky and J. W. S. Liu, “An object-oriented query processor that returns monotonically improving answers,” in Proc. 7th IEEE Conf. on Data Engineering (Kobe, Japan), Apr. 1991, pp. 472–481.
8. P. Buneman, S. Davidson, and A. Watters, “A semantics for complex objects and approximate queries,” in Proc.7th Symp. on the Principles of Database Systems, Mar. 1988, pp. 305–314.
9. G. K. Wallace, “Overview of the JPEG (ISO/CCITT) still image compression standard,” in Visual Communication and Image Processing, ‘ 89 (SPIE, Philadelphia, PA), Nov. 1989.
10. A. L. Liestman and R. H. Campbell, “A fault tolerant scheduling problem,” IEEE Trans. Software Eng., vol. SE-12, no. 10, pp. 1089–1095, Oct. 1986.
11. P. Gopinath and R. Gupta, “Applying compiler techniques to scheduling in real time systems,” in Proc. 11th IEEE Real Time Systems Symp. (Orlando, FL), Dec. 1990.
12. B. Kim and D. Towsley, “Dynamic flow control protocols for packet-switching multiplexers serving real time multipacket messages,” IEEE Trans. Commun., vol. COM-34, no. 4, Apr. 1986.
13. Y. Yemini, “A bang-bang principle for real time transport protocols,” in Proc. SIGCOMM ‘83 Symp. Commun. Architect. Protocols, May 1983, pp. 262–268.
14. W. Zhao and E. K. P. Chong, “Performance evaluation of scheduling algorithms for dynamic imprecise soft real time computer systems,” Australian Computer Sci. Commun., vol. 11, no. 1, pp 329–340, 1989.
15. E. L. Lawler and J. M. Moore, “A functional equation and its application to resource allocation and scheduling problem,” Manag. Sci., vol. 16, pp. 77–84, 1969.
16. W. K. Shih and J. W. S. Liu, “On-line scheduling of imprecise computations to minimize total error,” in Proc. 13th IEEE Real Time Time Systems Symp. (Phoenix, AZ), Dec. 1992, pp. 280–289.
17. C. L. Liu and J. W. Layland, “Scheduling algorithms for multiprogramming in a hard real time environment,” J. Assoc. Comput. Mach., vol. 20, pp. 46–61, 1973.
18. I. Cheong, “Heuristic algorithms for scheduling error-cumulative, cumulative, periodic jobs,” Ph.D. dissertation, Dep. of Computer Science, Univ. of Illinois, Jan. 1993.
19. K. I. J Ho, V. K. M. Yu, and W. D. Wei, “Minimizing the weighted number of tardy tasks units,” to appear in Discrete Appl. Math. J. Y-T. Leung and C. S. Wong, “Minimizing the number of late tasks with error constraints,” in Pmc. 11th Real Time Systems Symp. (Orlando, FL), Dec. 1990.
20. W. K. Shih and J. W. S. Liu, “Minimization of the maximum error of imprecise computations,” to be published in IEEE Trans. Comput.
21. K. I. J. Ho, J. Y. T. Leung and W. D. Wei, “Minimizing maximum weighted error of imprecise computation tasks,” Tech. Rep., Dep. of Computer Science and Engineering, Univ. of Nebraska, 1992.
22. K. I. J. Ho, J. Y. T. Leung, and W. D. Wei, “Scheduling imprecise computation tasks with 0/1 constraints,” Tech. Rep., Dep. of Computer Science and Engineering, Univ. of Nebraska, 1992.
23. W. K. Shih, J. W. S. Liu, and J. Y. Chung, “Algorithms for scheduling tasks to minimize total error,” SIAM J. Comput., vol. 20, no. 3, pp. 537–552, June 1991.
24. J. Y-T. Leung, T. W. Tam, C. S. Wong, and G. H. Wong, “Minimizing mean flow time with error constraints,” in Proc. 10th IEEE Real Time Systems Symp., Dec. 1989.
25. W. Zhao, S. Vrbsky, and J. W. S. Liu, “An analytical model for multi-server imprecise systems,” in Proc. 5th Int. Conf. on Parallel and Distributed Computing and Systems (Pittsburgh, PA), Sept. 1992.
26. J. Y. Chung, W. K. Shih, J. W. S. Liu, and D. W. Gillies, “Scheduling imprecise computations to minimize total error,” Microprocess. Microprogr., vol. 27, pp. 767–774, 1989.