Skip to main content
SpringerLink
Log in

Algorithms for Scheduling Imprecise Computations

  • Chapter
Foundations of Real-Time Computing: Scheduling and Resource Management

Part of the book series: The Springer International Series in Engineering and Computer Science ((SECS,volume 141))

Abstract

The imprecise computation technique ensures that all time-critical tasks produce their results before their deadlines by trading off the quality of the results for the computation time requirements of the tasks. This paper provides an overview of the problems in scheduling imprecise computations. It describes several workload models of imprecise computation that explicitly characterize the costs and benefits of the tradeoff and the scheduling algorithms that have been developed to achieve the desired tradeoff.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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, Mass, May, 1987.

    Google Scholar 

  2. K. J. Lin and S. Natarajan, “Concord: A System of Imprecise Computations,” Proceedings of the 1987 IEEE Compsac, pp. 75–81, Tokyo, Japan, October 7–9, 1987.

    Google Scholar 

  3. K. J. Lin, S. Natarajan, J. W. S. Liu, “Imprecise Results: Utilizing Partial Computations in Real-Time Systems,” Proceedings of the IEEE 8th Real-Time Systems Symposium, San Jose, California, December 1987.

    Google Scholar 

  4. J. W. S. Liu, K. J. Lin and S. Natarajan, “Scheduling Real-Time, Periodic Jobs Using Imprecise Results,” Proceedings of the 8th Real-Time Systems Symposium, pp. 252–260, San Jose, California, December 1–3, 1987.

    Google Scholar 

  5. J. Y. Chung, J. W. S. Liu, and K. J. Lin, “Scheduling Periodic Jobs that Allow Imprecise Results,” IEEE Transactions on Computers, Vol.19, No.9, pp. 1156–1173, September 1990.

    Article  Google Scholar 

  6. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, “Sequencing and Scheduling: Algorithms and Complexity,” Centre for Mathematics and Computer Science, Amsterdam, 1989.

    Google Scholar 

  7. E. G. Coffman Jr. and R. L. Graham, “Optimal Scheduling for Two-Processor Systems,” Acta Informatica, vol. 1, pp. 200–213, 1972.

    Article  MathSciNet  Google Scholar 

  8. M. R. Garey, D. S. Johnson, B. B. Simons, and R. E. Tarjan, “Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines,” SIAM J. Comput. 1981 vol. 10–2, pp. 256–269.

    MathSciNet  Google Scholar 

  9. R. L. Graham, “Bounds on Multiprocessing Timing Anomalies,” SIAM J. Appl. Math., vol. 17, pp. 263–269, 1969.

    Google Scholar 

  10. S. K. Dhall and C. L. Liu, “On a Real-Time Scheduling Problem,” Operations Research, Vol. 26, No. 1, pp. 127–140, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  11. D. Gillies and J. W. S. Liu “Greed in Resource Scheduling,” Proceedings of the 10th IEEE Real-Time Systems Symposium, pp. 285–294, Los Angeles, California, December 1989.

    Google Scholar 

  12. K. P. Smith, and J. W. S. Liu, “Monotonically Improving Approximate Answers to Relational Algebra Queries,” Proceedings of COMPSAC ‘89, Orlando, Florida, October 1989.

    Google Scholar 

  13. S. Vrbsky, K. P. Smith, and J. W. S. Liu, “An Object-Oriented Semantic Data Model to Support Approximate Query Processing,” Proceedings of IFIP TC2 Working Conference on Object-Oriented Database Semantics, July 1990.

    Google Scholar 

  14. P. Buneman, S. Davidson, and A. Watters, “A Semantics for Complex Objects and Approximate Queries,” Proceedings of the Seventh Symposium on the Principles of database Systems, pp. 305–314, March 1988.

    Google Scholar 

  15. G. Ozsoyoglu, Z. M. Ozsoyoglu, and W. Hou, “Research in Time-and Error-Constrained Database Query Processing,” Proceedings of the 7th IEEE Workshop on Real-Time Operating Systems and Software, Charlottesville, VA, May 1990.

    Google Scholar 

  16. K. J. Lin and S. Natarajan, “Expressing and Maintaining Timing Constraints in FLEX,” Proceedings of the IEEE 9th Real-Time Systems Symposium, Huntsville, Alabama, December 1988.

    Google Scholar 

  17. S. Natarajan and K. J. Lin, “FLEX: Towards Flexible Real-Time Programs,” Proceedings of IEEE International Conference on Computer Languages, October 1988.

    Google Scholar 

  18. S. Natarajan, “Building Flexible Real-Time System,” Ph.D. thesis, Department of Computer Science, University of Illinois, August 1989.

    Google Scholar 

  19. K. J. Lin and K. Kenny, “Implementing Timing Constraint in FLEX,” submitted to IEEE Trans. Software Engineering.

    Google Scholar 

  20. A. L. Liestman and R. H. Campbell, “A Fault-Tolerant Scheduling Problem,” IEEE Transactions on Software Engineering, vol. SE-12, No. 10., pp. 1089–1095, Oct. 1986.

    Article  Google Scholar 

  21. K. Kenny and K. J. Lin, “Structuring Real-Time Systems with Performance Polymorphism,” Proceedings of the 11th IEEE Real-Time Systems Symposium, Orlando, Florida, December 1990.

    Google Scholar 

  22. P. Gopinath and R. Gupta, “Applying Compiler Techniques to Scheduling in Real-Time Systems,” Proceedings of the 11th IEEE Real-Time Systems Symposium, Orlando, Florida, December 1990.

    Google Scholar 

  23. A. S. Grimshaw, J. W. S. Liu and A. Silberman, “Real-Time Mentat, A Data-Driven, Object-Oriented System,” Proceedings of IEEE Globecom, pp. 141–147, Dallas, Texas, November 1989.

    Google Scholar 

  24. B. Kim and D. Towsley, “Dynamic Flow Control Protocols for Packet-Switching Multiplexers Serving Real-Time Multipacket Messages,” IEEE Transactions on Communications, Vol.COM34, No.4, April 1986.

    Google Scholar 

  25. Y. Yemini, “A Bang-Bang Principle for Real-Time Transport Protocols,” Proc. SIGCOMM ‘83 Symp. Commun. Architect. Protocols, pp. 262–268, May 1983.

    Google Scholar 

  26. G. J. Gregory and K. J. Lin, “Building Real-Time Imprecise Computations in Ada,” Proceedings of Tri-Ada, Baltimore, December 1990.

    Google Scholar 

  27. 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.

    Article  MathSciNet  MATH  Google Scholar 

  28. A. K. Mok, “Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment,” Ph.D. Thesis, Department of Electrical Engineering and Computer Science, M.I.T., 1983.

    Google Scholar 

  29. J. Y.-T. Leung and M. L. Merrill, “A Note on Preemptive Scheduling of Periodic, Real-Time Tasks,” Information Processing Letters, vol. 11, no. 3, pp. 115–118, November, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  30. E. L. Lawler and J. M. Moore, “A Functional Equation and Its Application to Resource Allocation and Scheduling Problem,” Management Science, Vol. 16, pp. 77–84, 1969.

    Article  MATH  Google Scholar 

  31. W. K. Shih and J. W. S. Liu, “Minimization of the Maximum Error of Imprecise Computations.” manuscript in preparation.

    Google Scholar 

  32. J. Y-T. Leung and C. S. Wong, “Minimizing the Number of Late Tasks with Error Constraints,” Proceedings of the 11th Real-Time Systems Symposium, Orlando, Florida, December 1990.

    Google Scholar 

  33. J. Y-T. Leung, T. W. Tam, C. S. Wong, and G. H. Wong, “Minimizing Mean Flow Time with Error Constraints,” Proceedings of the 10th IEEE Real-Time Systems Symposium, December 1989.

    Google Scholar 

  34. W. K. Shih, J. W. S. Liu, J. Y. Chung and D. W. Gillies, “Scheduling Tasks with Ready Times and Deadlines to Minimize Average Error,” ACM Operating Systems Review, July 1989.

    Google Scholar 

  35. W. K. Shih, J. W. S. Liu, and J. Y. Chung, “Fast Algorithms for Scheduling Tasks with Ready Times and Deadlines to Minimize Total Error,” Proceedings of the 10th IEEE Real-Time Systems Symposium, December 1989.

    Google Scholar 

  36. W. K. Shih, J. W. S. Liu, and J. Y. Chung, “Algorithms for Scheduling Imprecise Computations with Timing Constraints,” to appear in SIAM Journal of Computing.

    Google Scholar 

  37. R. McNaughton, “Scheduling with Deadlines and Loss Functions,” Management Science, Vol. 12, pp. 1–12, 1959.

    Article  MathSciNet  Google Scholar 

  38. A. A. Bertossi and M. A. Bonuccelli, “Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems,” Information Processing Letters, vol. 16, pp. 3–6, January, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  39. Leung, J. Y.-T. and J. Whitehead, “On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks,” Performance Evaluation, vol. 2, pp. 237–250, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  40. Lawler, E. L. and C. U. Martel, “Scheduling Periodically Occurring Tasks on Multiple Processors,” Information Processing Letters, vol. 12, no. 1, pp. 9–12, February, 1981.

    Article  MathSciNet  MATH  Google Scholar 

  41. Chung, J. Y. and J. W. S. Liu, “Performance of Algorithms for Scheduling Periodic Jobs to Minimize Average Error,” Proceedings of the IEEE 9th Real-Time Systems Symposium, Huntsville, Alabama, December 1988.

    Google Scholar 

  42. Chung, J. Y., “Scheduling Periodic Jobs Making Use of Imprecise Results,” Ph.D. Thesis, Department of Computer Science, University of Illinois, May 1989.

    Google Scholar 

  43. Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York, 1979.

    Google Scholar 

  44. 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, February, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  45. C. Han and K. J. Lin, “Scheduling Parallelizable Real-Time Jobs on Multiprocessors,” Proceedings of the 10th IEEE Real-Time Systems Symposium, December 1989.

    Google Scholar 

  46. J. Du and J. Y-T. Leung, “Complexity of Scheduling Parallel Task Systems,” Technical Report UTDCS 6–87, University of Texas at Dallas, Dallas, TX, 1987.

    Google Scholar 

  47. N. Karmarker, “A New Polynomial-Time Algorithm for Linear Programming,” Combinatorica, vol. 4, pp. 373–395, 1984.

    Article  MathSciNet  Google Scholar 

  48. L. G. Khanchian, “Polynomial Algorithms in Linear Programming,” Zhurnal Vychislitelnoi Mathematiki Matematicheskoi Fiziki, vol. 20, pp. 53–72, 1980.

    Google Scholar 

  49. A. C. Yu and K. J. Lin, “Scheduling Parallelizable Imprecise Computations on Multiprocessors,” submitted for publication.

    Google Scholar 

  50. E. L. Lawler, “Fast Approximation Algorithms for Knapsack Problems,” Math. of Operations Research, vol.4, pp. 339–356, November 1979.

    Article  MathSciNet  MATH  Google Scholar 

  51. E. K. P. Chong and W. Zhao, “Performance Evaluation of Scheduling Algorithms for Imprecise Computer Systems,” submitted for publication. Also as Tech. Report, Department of Computer Science, University of Adelaide, SA 5006, Australia, September 1988.

    Google Scholar 

  52. E. K. P. Chong and W. Zhao, “Task Scheduling for Imprecise Computer Systems with User Controlled Optimization”, Proc. of International Conference on Computers and Information, May 1989.

    Google Scholar 

  53. W. Zhao and E. K. P. Chong, “Performance Evaluation of Scheduling Algorithms for Dynamic Imprecise Soft Real—Time Computer Systems”, Australian Computer Science Communications, Vol. 11, No. 1, 1989, pp 329–340.

    Google Scholar 

  54. W. Zhao and J. W. S. Liu, “An Analytical Model for Multi—Server Imprecise Systems”, Tech. Report, Department of Computer Science, University of Adelaide, July 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, 61801, USA

    J. W. S. Liu, K. J. Lin, W. K. Shih & A. C. Yu

  2. T.J. Watson Research Center, IBM, Yorktown Heights, NY, 10598, USA

    J. Y. Chung

  3. Department of Computer Science, Texas A&M University, College Station, TX, 77843, USA

    W. Zhao

Authors
  1. J. W. S. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. J. Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. W. K. Shih
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. A. C. Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. J. Y. Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. W. Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Office of Naval Research, USA

    André M. van Tilborg  & Gary M. Koob  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media New York

About this chapter

Cite this chapter

Liu, J.W.S., Lin, K.J., Shih, W.K., Yu, A.C., Chung, J.Y., Zhao, W. (1991). Algorithms for Scheduling Imprecise Computations. In: van Tilborg, A.M., Koob, G.M. (eds) Foundations of Real-Time Computing: Scheduling and Resource Management. The Springer International Series in Engineering and Computer Science, vol 141. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3956-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-3956-8_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6766-6

  • Online ISBN: 978-1-4615-3956-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation