
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
J.Y. Chung, J.W.S. Liu, K.J. Lin, "Scheduling Periodic Jobs that Allow Imprecise Results," IEEE Transactions on Computers, vol. 39, no. 9, pp. 11561174, September, 1990.  
BibTex  x  
@article{ 10.1109/12.57057, author = {J.Y. Chung and J.W.S. Liu and K.J. Lin}, title = {Scheduling Periodic Jobs that Allow Imprecise Results}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {9}, issn = {00189340}, year = {1990}, pages = {11561174}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.57057}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Scheduling Periodic Jobs that Allow Imprecise Results IS  9 SN  00189340 SP1156 EP1174 EPD  11561174 A1  J.Y. Chung, A1  J.W.S. Liu, A1  K.J. Lin, PY  1990 KW  periodic jobs; scheduling; realtime systems; imprecise computations; workload models; operating systems (computers); realtime systems; scheduling. VL  39 JA  IEEE Transactions on Computers ER   
The problem of scheduling periodic jobs in hard realtime systems that support imprecise computations is discussed. Timing faults are avoided in such systems by making available intermediate, imprecise results of acceptable quality when results of the desired quality cannot be produced on time. Two workload models of imprecise computations are presented. These models differ from traditional models in that a task may be terminated any time after it has produced an acceptable result. Each task is logically decomposed into a mandatory part followed by an optional part. In a feasible schedule, the mandatory part of every task is completed before the deadline of the task. The optional part refines the result produced by the mandatory part to reduce the error in the result.
[1] K. J. Lin, S. Natarajan, J. W.S. Liu, and T. Krauskopf, "Concord: A system of imprecise computations," inProc. 1987 IEEE Compsac, Japan, Oct. 1987.
[2] K. J. Lin, S. Natarajan, and J. W. S. Liu, "Imprecise results: Utilizing partial computations in realtime systems," inProc. IEEE RealTime Syst. symp., 1987.
[3] J. W. S. Liu, K. J. Lin, and S. Natarajan, "Scheduling realtime, periodic jobs using imprecise results," inProc. IEEE RealTime Syst. Symp., 1987.
[4] A. L. Liestman and R. H. Campbell, "A faulttolerant scheduling problem,"IEEE Trans. Software Eng., vol. SE12, no. 11, pp. 10891095, Nov. 1986.
[5] A. K. Basu, "On development of iterative programs from function specifications,"IEEE Trans. Software Eng., vol. SE6, pp. 170182, Mar. 1980.
[6] W. M. Turski, "On programming by iterations,"IEEE Trans. Software Eng., vol. SE10, pp. 175178, Mar. 1984.
[7] K. M. Chandy, J. Misra, and L. M. Haas, "Distributed deadlock detection,"ACM Trans. Comput. Syst., vol. 1, no. 2, pp. 144156, May 1983.
[8] R. Bellman and S. Dreyfus,Applied Dynamic Progmmming. Princeton, NJ: Princeton University Press, 1962.
[9] Y. Shreider, Ed.,Method of Statistical Testing: Monte Carlo Method. New York: Elsevier, 1964.
[10] S. B. Davidson and A. Watters, "Partial computation in realtime database systems," inProc. 5th Workshop RealTime Oper. Syst. Software, Washington, DC, May 1213, 1988.
[11] E. G. Coffman Jr. and R. Graham,Scheduling Theory. New York: Wiley, 1976.
[12] J. K. Lenstra and A. H. G. Rinnooy Kan, "Scheduling theory since 1981: An annotated bibliography," Rep. BW 188/83, Mathematisch Centrum, Amsterdam, The Netherlands, 1983.
[13] J. K. Lenstra and A. H. G. Rinnooy Kan, "New directions in scheduling theory,"Oper. Res. Lett., vol. 2, pp. 255259, 1984.
[14] C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard realtime environment,"J. ACM, vol. 20, no. 1, pp. 4661, Jan. 1973.
[15] S. K. Dhall and C. L. Liu, "On a realtime scheduling problem,"Oper. Res., vol. 26. no. 1, pp. 127140, 1978.
[16] J. Y.T. Leung and M. L. Merrill, "A note on preemptive scheduling of periodic, realtime tasks,"Inform. Processing Lett., vol. 11, no. 3, pp. 115118, Nov. 1980.
[17] J. Y.T. Leung and J. Whitehead, "On the complexity of fixedpriority scheduling of periodic, realtime tasks,"Perform. Eval., vol. 2, pp. 237250, 1982.
[18] E. L. Lawler and C. U. Martel, "Scheduling periodically occurring tasks on multiple processors,"Inform. Processing Lett., vol. 12, no. 1, pp. 912, Feb. 1981.
[19] A. K. Mok and M. L. Dertouzos, "Multiprocessor scheduling in a hard realtime environment," inIEEE Proc. Seventh Texas Conf. Comput. Symp., Nov. 1978, pp. 51, 512.
[20] A. A. Bertossi and M. A. Bonucelli, "Preemptive scheduling of periodic jobs in uniform multiprocessor systems,"Inform. Processing Lett., vol. 16, pp. 36, Jan. 1983.
[21] J. Stankovic, K. Ramamritham, and S. Chang, "Evaluation of a flexible task scheduling algorithm for distributed hard realtime systems,"IEEE Trans. Comput., vol. C34, no. 12, pp. 11301143, Dec. 1985.
[22] W. Zhao and K. Ramamritham, "Distributed scheduling using bidding and focused addressing," inProc. IEEE RealTime Symp., Dec. 1985.
[23] D. W. Leinbaugh and M. Yamini, "Guaranteed response time in a distributed hard realtime environment," inProc. RealTime Syst. Symp., Dec. 1982, pp. 157169.
[24] J. H. Wensley, L. Lamport, J. Goldberg, M. W. Green, K. N. Levitt, P. M. MelliarSmith, R. E. Shostak, and C. B. Weinstock, "SIFT: Design and analysis of a faulttolerant computer for aircraft control,"Proc. IEEE, vol. 66, no. 10, pp. 12401255, Oct. 1978.
[25] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. San Francisco, CA: Freeman, 1979.
[26] E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson, "An application of binpacking to multiprocessor scheduling,"SIAM J. Comput., vol. 7, no. 1, pp. 117, Feb. 1978.