Skip to main content
SpringerLink
Log in

Research in Real-Time Scheduling

  • 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

In this paper we give a survey of our recent work in real-time scheduling. This includes message routing in distributed real-time systems, minimizing mean flow time and number of late tasks in the imprecise computation model, developing efficient feasibility tests, on-line scheduling of real-time tasks, minimizing number of late tasks in the classical task system model, developing and analyzing a new model of task system that can incorporate parallel algorithms, minimizing mean flow time with release time and precedence constraints, and a host of other scheduling problems. Our work has focused on the study of complexity results, efficient algorithms, worst-case analysis of fast heuristics, and possibility and impossibility results for the existence of optimal on-line algorithms.

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.

References

  1. K. R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974.

    Google Scholar 

  2. J. Blazewicz, M. Drabowski and J. Welgarz, “Scheduling Multiprocessor Tasks to Minimize Schedule Length,” IEEE Transactions on Computers C- 35,1986, pp. 389–393.

    Article  MATH  Google Scholar 

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

    Google Scholar 

  4. J-Y. Chung and J. W. S. Liu, “Algorithms for Scheduling Periodic Jobs to Minimize Average Error,” Proc. of the 9th IEEE Real-Time Systems Symposium,1988, pp. 142–151.

    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, to appear.

    Google Scholar 

  6. E. G. Coffman, Jr., (Ed.) Computer and Job-Shop Scheduling Theory, Wiley, New York, 1976.

    MATH  Google Scholar 

  7. M. Dertouzos, “Control Robotics: The Procedural Control of Physical Processes,” Proc. of the IFIP Congress, 1974, pp. 807–813.

    Google Scholar 

  8. J. Du and J. Y-T. Leung, “Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length,” SIAM J. on Disc. Math. 2,1989, pp. 176–196.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. Du and J. Y-T. Leung, “Complexity of Scheduling Parallel Task Systems,” SIAM J. on Disc. Math. 2, 1989, pp. 473–487.

    Article  MathSciNet  MATH  Google Scholar 

  10. J. Du and J. Y-T. Leung, “Minimizing Total Tardiness on One Machine is NP-hard,” Math. of Operations Research 15, 1990, pp. 483–495.

    Article  MathSciNet  MATH  Google Scholar 

  11. J. Du and J. Y-T. Leung, “Minimizing the Number of Late Jobs on Unrelated Machines,” Operations Research Letters, to appear.

    Google Scholar 

  12. J. Du and J. Y-T. Leung, “Minimizing Mean Flow Time with Release Time and Deadline Constraints,” J. of Algorithms, to appear.

    Google Scholar 

  13. J. Du and J. Y-T. Leung, “Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops,” Tech. Rept. UTDCS-12–90, Computer Science Program, University of Texas at Dallas, Richardson, TX, 1990.

    Google Scholar 

  14. J. Du, J. Y-T. Leung and C. S. Wong, “Minimizing the Number of Late Jobs with Release Time Constraint,” Tech. Rept. UTDCS-13–89, Computer Science Program, University of Texas at Dallas, Richardson, TX, 1989.

    Google Scholar 

  15. J. Du, J. Y-T. Leung and G. H. Young, “Minimizing Mean Flow Time with Release Time Constraint,” Theoretical Computer Science 75, 1990, pp. 347–355.

    MathSciNet  MATH  Google Scholar 

  16. J. Du, J. Y-T. Leung and G. H. Young, “Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time,” Information and Computation, to appear.

    Google Scholar 

  17. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.

    Google Scholar 

  18. K. S. Hong and J. Y-T. Leung, “On-Line Scheduling of Real-Time Tasks,” Proc. of the 9th IEEE Real-Time Systems Symposium, 1988, pp. 244–250.

    Google Scholar 

  19. K. S. Hong and J. Y-T. Leung, “Preemptive Scheduling with Release Times and Deadlines,” J. of Real-Time Systems 1, 1989, pp. 265–281.

    Article  Google Scholar 

  20. W. Horn, “Some Simple Scheduling Algorithms,” Naval Res. Logist. Quarterly 21, 1974, pp. 177–185.

    MathSciNet  MATH  Google Scholar 

  21. J. Labetoulle, “Some Theorems on Real-Time Scheduling,” in E. Gelenbe and R. Mahls(Eds.), Computer Architecture and Networks, North Holland, Amsterdam, 1974, pp. 285–293.

    Google Scholar 

  22. B. J. Lageweg, E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, “Computer Aided Complexity Classification of Deterministic Scheduling Problems,” Report BW 138, Mathematisch Centrum, Amsterdam, 1981.

    Google Scholar 

  23. E. L. Lawler, “Preemptive Scheduling of Uniform Parallel Machines to Minimize the Weighted Number of Late Jobs,” Report BW 105, Mathematisch Centrum, Amsterdam, 1979.

    Google Scholar 

  24. E. L. Lawler, “Recent Results in the Theory of Scheduling,” in A. Bachem, M. Grotschel and B. Korte, (Eds.), Mathematical Programming: The State of the Art, Springer, 1982.

    Google Scholar 

  25. E. L. Lawler, “New and Improved Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs,” Preprint, Computer Science Division, University of California, Berkeley, CA,1989.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  27. J. K. Lenstra, unpublished results.

    Google Scholar 

  28. J. Y-T. Leung, T. W. Tam and C. S. Wong, “Heuristics for Minimizing Mean Flow Time with Error Constraint,” Tech. Rept. UTDCS-25–89, Computer Science Program, University of Texas at Dallas, Richardson, TX, 1989.

    Google Scholar 

  29. J. Y-T. Leung, T. W. Tam, C. S. Wong and G. H. Young, “Routing Messages with Release Time and Deadline Constraints,” Proc. of Euromicro Workshop on Real Time, Como, Italy, 1989, pp. 168–177.

    Google Scholar 

  30. J. Y-T. Leung, T. W. Tam, C. S. Wong and G. H. Young, “Minimizing Mean Flow Time with Error Constraints,” Proc. of the 10th IEEE Real-Time Systems Symposium, 1989, pp. 2–11.

    Google Scholar 

  31. J. Y-T. Leung, T. W. Tam and G. H. Young, “On-Line Routing of Real-Time Messages,” Proc. of the 11th IEEE Real-Time Systems Symposium, 1990, pp. 126–135.

    Google Scholar 

  32. J. Y-T. Leung and C. S. Wong, “Minimizing the Number of Late Tasks with Error Constraint,” Proc. of the 11th IEEE Real-Time Systems Symposium, 1990, pp. 32–40.

    Google Scholar 

  33. J. Y-T. Leung and G. H. Young, “Minimizing Schedule Length Subject to Minimum Flow Time, ” SIAM J. on Computing 18, 1989, pp. 314–326.

    Article  MathSciNet  MATH  Google Scholar 

  34. J. Y-T. Leung and G. H. Young, “Preemptive Scheduling to Minimize Mean Weighted Flow Time, ” Information Processing Letters 34, 1990, pp. 47–50.

    Article  MathSciNet  MATH  Google Scholar 

  35. J. Y-T. Leung and G. H. Young, “Minimizing Total Tardiness on a Single Machine with Precedence Constraint,” ORSA J. on Computing 2, 1990, pp. 346–352.

    Article  MATH  Google Scholar 

  36. K-J. Lin, S. Natarajan and J. W. S. Liu, “Concord: A Distributed System Making Use of Imprecise Results,” Proc. of COMPSAC’87, Tokyo, Japan, 1987.

    Google Scholar 

  37. K-J. Lin, S. Natarajan and J. W. S. Liu, “Imprecise Results: Utilizing Partial Computations in Real-Time Systems,” Proc of the 8th IEEE Real-Time Systems Symposium,1987, pp. 210–217.

    Google Scholar 

  38. C. L. Liu and J. W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM 20, 1973, pp. 46–61.

    Article  MathSciNet  MATH  Google Scholar 

  39. C. Y. Liu and R. L. Bulfin, “On the Complexity of Preemptive Open-Shop Scheduling Problems,” Oper. Res. Letters 4, 1985, pp. 71–74.

    Article  MathSciNet  MATH  Google Scholar 

  40. J. W. S. Liu, K-J. Lin and S. Natarajan, “Scheduling Real-Time, Periodic Jobs Using Imprecise Results,” Proc. of the 8th IEEE Real-Time Systems Symposium, 1987, pp. 252–260.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  42. A. K. Mok, Fundamental Design Problems of Distributed Systems for the Hard Real Time Environment, Ph.D. Dissertation, M.I.T., 1983.

    Google Scholar 

  43. J. M. Moore, “Sequencing n Jobs on One Machine to Minimize the Number of Tardy Jobs,” Management Science 15,1968, pp. 102–109.

    Article  MATH  Google Scholar 

  44. S. Sahni, “Preemptive Scheduling with Due Dates,” Oper. Res. 27,1979, pp. 925–934.

    Article  MathSciNet  MATH  Google Scholar 

  45. S. Sahni and Y. Cho, “Nearly On-Line Scheduling of a Uniform Processor System with Release Times,” SIAM J. Computing 8, 1979, pp. 275–285.

    Article  MathSciNet  MATH  Google Scholar 

  46. W-K. Shih, J. W. S. Liu and J-Y. Chung, “Fast Algorithms for Scheduling Imprecise Computations,” Proc. of the 10th IEEE Real-Time Systems Symposium, 1989, pp. 12–19.

    Google Scholar 

  47. 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,” Tech. Rept. UIUCDCS-R-891478, Dept. of Computer Science, University of Illinois, Urbana, IL, 1989.

    Google Scholar 

  48. W. E. Smith, “Various Optimizers for Single-Stage Production,” Naval Res. Logist. Quarterly 3, 1956, pp. 59–66.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Nebraska at Lincoln, Lincoln, NE, 68588-0115, USA

    Joseph Y.-T. Leung

Authors
  1. Joseph Y.-T. Leung
    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

Leung, J.YT. (1991). Research in Real-Time Scheduling. 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_2

Download citation

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

  • 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