This Article 
 Bibliographic References 
 Add to: 
Scheduling Periodic Jobs that Allow Imprecise Results
September 1990 (vol. 39 no. 9)
pp. 1156-1174

The problem of scheduling periodic jobs in hard real-time 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 real-time systems," inProc. IEEE Real-Time Syst. symp., 1987.
[3] J. W. S. Liu, K. J. Lin, and S. Natarajan, "Scheduling real-time, periodic jobs using imprecise results," inProc. IEEE Real-Time Syst. Symp., 1987.
[4] A. L. Liestman and R. H. Campbell, "A fault-tolerant scheduling problem,"IEEE Trans. Software Eng., vol. SE-12, no. 11, pp. 1089-1095, Nov. 1986.
[5] A. K. Basu, "On development of iterative programs from function specifications,"IEEE Trans. Software Eng., vol. SE-6, pp. 170-182, Mar. 1980.
[6] W. M. Turski, "On programming by iterations,"IEEE Trans. Software Eng., vol. SE-10, pp. 175-178, Mar. 1984.
[7] K. M. Chandy, J. Misra, and L. M. Haas, "Distributed deadlock detection,"ACM Trans. Comput. Syst., vol. 1, no. 2, pp. 144-156, 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 real-time database systems," inProc. 5th Workshop Real-Time Oper. Syst. Software, Washington, DC, May 12-13, 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. 255-259, 1984.
[14] C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment,"J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[15] S. K. Dhall and C. L. Liu, "On a real-time scheduling problem,"Oper. Res., vol. 26. no. 1, pp. 127-140, 1978.
[16] J. Y.-T. Leung and M. L. Merrill, "A note on preemptive scheduling of periodic, real-time tasks,"Inform. Processing Lett., vol. 11, no. 3, pp. 115-118, Nov. 1980.
[17] J. Y.-T. Leung and J. Whitehead, "On the complexity of fixed-priority scheduling of periodic, real-time tasks,"Perform. Eval., vol. 2, pp. 237-250, 1982.
[18] E. L. Lawler and C. U. Martel, "Scheduling periodically occurring tasks on multiple processors,"Inform. Processing Lett., vol. 12, no. 1, pp. 9-12, Feb. 1981.
[19] A. K. Mok and M. L. Dertouzos, "Multiprocessor scheduling in a hard real-time environment," inIEEE Proc. Seventh Texas Conf. Comput. Symp., Nov. 1978, pp. 5-1, 5-12.
[20] A. A. Bertossi and M. A. Bonucelli, "Preemptive scheduling of periodic jobs in uniform multiprocessor systems,"Inform. Processing Lett., vol. 16, pp. 3-6, Jan. 1983.
[21] J. Stankovic, K. Ramamritham, and S. Chang, "Evaluation of a flexible task scheduling algorithm for distributed hard real-time systems,"IEEE Trans. Comput., vol. C-34, no. 12, pp. 1130-1143, Dec. 1985.
[22] W. Zhao and K. Ramamritham, "Distributed scheduling using bidding and focused addressing," inProc. IEEE Real-Time Symp., Dec. 1985.
[23] D. W. Leinbaugh and M. Yamini, "Guaranteed response time in a distributed hard real-time environment," inProc. Real-Time Syst. Symp., Dec. 1982, pp. 157-169.
[24] J. H. Wensley, L. Lamport, J. Goldberg, M. W. Green, K. N. Levitt, P. M. Melliar-Smith, R. E. Shostak, and C. B. Weinstock, "SIFT: Design and analysis of a fault-tolerant computer for aircraft control,"Proc. IEEE, vol. 66, no. 10, pp. 1240-1255, Oct. 1978.
[25] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[26] E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson, "An application of bin-packing to multiprocessor scheduling,"SIAM J. Comput., vol. 7, no. 1, pp. 1-17, Feb. 1978.

Index Terms:
periodic jobs; scheduling; real-time systems; imprecise computations; workload models; operating systems (computers); real-time systems; scheduling.
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. 1156-1174, Sept. 1990, doi:10.1109/12.57057
Usage of this product signifies your acceptance of the Terms of Use.