Skip to main content
SpringerLink
Log in

Recent Results 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

This paper gives an overview of several recent results on real-time scheduling. Specifically, it presents the workload models that characterize the following types of tasks: tasks with AND/OR precedence constraints, tasks with temporal distance constraints, distributed tasks with overall deadlines, and tasks with deferrable deadlines. Suitable algorithms for scheduling tasks of each type are described.

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. D. W. Gillies and J. W. S. Liu, “Scheduling Tasks with AND/OR Precedence Constraints,” Proceeding of the 2nd IEEE Conference on Parallel and Distributed Processing, Dallas, Texas,December 1990.

    Google Scholar 

  2. D. W. Gillies and J. W. S. Liu, “Scheduling Tasks with AND/OR Precedence Constraints,” Technical Report No. UIUCDCS–R90–1627, Department of Computer Science, University of Illinois, September1990.

    Google Scholar 

  3. D. Peng and K. G. Shin, “Modeling of Concurrent Task Execution in a Distributed System for Real–Time Control,” IEEE Transactions on Computersvol. 36, no. 5, pp. 500–516, April 1987.

    Article  Google Scholar 

  4. M. C. McElvany, “Guaranteeing Deadlines in MAFT ” Proceedings of the IEEE Real-Time Systems Symposium, vol. 9, pp. 130–139,December 1988.

    Article  Google Scholar 

  5. V. Saletore and L. V. Kale, “Obtaining First Solution Faster in AND and OR Parallel Execution of Logic Programs ” North American Conference on Logic Programming vol. 1, pp. 390–406, October 1989.

    Google Scholar 

  6. P. R. Chang, “Parallel Algorithms and VLSI Architectures for Robotics and Assembly Scheduling,” Ph.D. Thesis, Purdue University, West Lafayette, Indiana, December 1988

    Google Scholar 

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

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

    Google Scholar 

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

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

  11. J. W. S. Liu, K. J. Lin, W. K. Shih, A. C. Yu, J. Y. Chung, and W. Zhao, “Algorithms for Scheduling Imprecise Computations,” Technical Report No. UIUCDCS-90-R-1628, Department of Computer Science, University of Illinois,September 1990.

    Google Scholar 

  12. M. R. Garey and D. S. Johnson, “Two-Processor Scheduling with Start-Times and Deadlines,” SIAM Journal on Computing vol 6, pp 416–428, 1977.

    MathSciNet  MATH  Google Scholar 

  13. 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. Computing vol. 10,no. 2, pp. 256–269, May 1981

    Article  MathSciNet  MATH  Google Scholar 

  14. M. R. Garey and D. S. Johnson, “Scheduling Tasks with Nonuniform Deadlines on Two Processors” J. Assoc. Comput. Mach.vol. 23, pp. 461–467 1976

    Article  MathSciNet  MATH  Google Scholar 

  15. T. C. Hu, “Parallel Sequencing and Assembly Line Problems,” Operations Research,vol. 9, pp. 841–848 1961.

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

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

  18. J. M. Moore, “An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs,” Management Science,vol.15, pp. 102–109,1968.

    Article  MATH  Google Scholar 

  19. C.-C.Han, and K. J. Lin, “Scheduling Jobs with Temporal Consistency Constraints,” Proc. 6th IEEE Workshop on Real–Time Operating Systems and SoftwarePittsburgh, PA, May1989. Also Technical Report No. UIUCDCS-90–1630,Department of Computer Science, University of Illinois, September1990.

    Google Scholar 

  20. Han, C., K. J. Lin and J. W. S. Liu, “A Polynomial-Time Scheduling Algorithm for Jobs with Temporal Distance Constraint,” submitted for publication.

    Google Scholar 

  21. R. Bettati and J. W. S. Liu, “Algorithms for End-to-End Scheduling to Meet Deadlines,” Proceedings of the 2nd IEEE Conference on Parallel and Distributed Systems, Dallas, Texas December 1990.

    Google Scholar 

  22. R. Bettati and J. W. S. Liu, “Algorithms for End-to-End Scheduling to Meet Deadlines,” Technical Report No. UIUCDCS-R-1594,Department of Computer Science, University of Illinois,1990.

    Google Scholar 

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

    MATH  Google Scholar 

  24. M. R. Garey, D. S. Johnson, and R. Sethi, “The Complexity of Flowshop and Jobshop scheduling ” Math. Oper. Res. vol. 1, pp. 117–129, 1976.

    Article  MathSciNet  MATH  Google Scholar 

  25. J. Blazewicz, W. Kubiak and J. Szwarcfiter, “Scheduling Unit-Time Tasks on Flow Shops under Resource Constraints,” Annals of Operations Research, 16, 255–266, 1988.

    Article  MathSciNet  Google Scholar 

  26. C. M. Woodside and D. W. Graig, “Local Non-Preemptive Scheduling Policies for Hard Real-Time Distributed Systems,” Proceeding of Real-Time Systems Symposium, December 1987.

    Google Scholar 

  27. L. Sha, J. P. Lehoczky, and R. Rajkumar, “Solutions for Some Practical Problems in Prioritized Preemptive Scheduling,” Proceeding of Real-Time Systems Symposium, December 1986.

    Google Scholar 

  28. E. Lawler, J. K. Lenstra, C. Martel, B. Simons, and L. Stockmeyer, “Pipeline Scheduling: A Survey,” Technical Report, RJ 5738, IBM Research Division, San Jose, CA., 1987.

    Google Scholar 

  29. K. V. Palem and B. Simons, “Scheduling Time-Critical Instructions on RISC Machines,” to appear in Sigplan ‘80.

    Google Scholar 

  30. T. Gonzalez and S. Sahni, “Flowshop and Jobshop Schedule: Complexity and Approximation,” Operation Research(1978) vol. 26–1, pp. 37–52.

    MathSciNet  Google Scholar 

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

  32. J. P. Lehoczky and L. Sha, “Performance of Real-Time Bus Scheduling Algorithms,” ACM Performance Evaluation Review,14, 1986

    Google Scholar 

  33. D. T. Peng and K. G. Shin, ‘A New Performance Measure for Scheduling Independent Real-Time Tasks,” Technical Report, Department of Electrical Engineering and Computer Science, University of Michigan, 1989.

    Google Scholar 

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

  35. A. K. Mok and M. L. Dertouzos, “Multiprocessor Scheduling in A Hard Real-Time Environment,” IEEE Proceedings Seventh Texas Conf. Comput. Symp., pp. 5–1,5–12,November 1978.

    Google Scholar 

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

  37. J. Lehoczky, “Fixed Priority Scheduling of Jobs with Variable Deadlines,” Proceedings of the 11th IEEE Real-Time Systems Symposium, December 1990.

    Google Scholar 

  38. W. K., Shih, J. W. S. Liu, and C. L. Liu “Scheduling Periodic Jobs with Deferred Deadlines ” Technical Report No. UIUCDCS-R-90–1593, Department of Computer Science, University of Illinois, April 1990.

    Google Scholar 

  39. J. W. Stoughton and R. R. Mielke, “Strategies for Concurrent Processing of Complex Algorithms in Data-Driven Architectures,” NASA Contractor Report No. 181657, Nasa Langley Research Center, February 1988.

    Google Scholar 

  40. J. R. Ellis, “A New Approach to Ensuring Deterministic Processing in an Integrated Avionics Software System,” Proceedings of the IEEE NAECON, pp. 756–764, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    R. Bettati, D. Gillies, C. C. Han, K. J. Lin, C. L. Liu, J. W. S. Liu & W. K. Shih

Authors
  1. R. Bettati
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Gillies
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. C. Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. K. J. Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. C. L. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. J. W. S. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. W. K. Shih
    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

Bettati, R. et al. (1991). Recent Results 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_4

Download citation

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

  • 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