Skip to main content
Log in

Priority Scheduling Versus Pre-Run-Time Scheduling

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

Builders of real-time systems often use priority scheduling in their systems without considering alternatives. This paper examines one alternative, pre-run-time scheduling, and show that when it can be applied it has significant advantages when compared to priority scheduling schemes.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Audsley, N., Tindell, K. and Burns, A. 1993. The end of the line for static cyclic scheduling. Proc. Fifth Euromicro Workshop on Real-Time Systems 36–41.

  • Belpaire, G. and Wilmotte, J. P. 1973. A semantic approach to the theory of parallel processes. Proc. 1973 European ACM Symposium 217–222.

  • Burns, A., Tindell, K. and Wellings, A. 1995. Effective analysis for engineering real-time fixed priority schedulers. IEEE Trans. Software Eng. 21: 475–480.

    Google Scholar 

  • Faulk, S. R. and Parnas, D. L. 1988. On synchronization in hard-real-time systems. Communications of the ACM 31: 274–287.

    Google Scholar 

  • Heninger, K., Kallander, J., Parnas, D. L. and Shore, J. 1978. Software Requirements for the A-7E Aircraft, NRL Report No. 3876, Nov.

  • Liu, C. L. and Layland, J.W. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20: 46–61.

    Google Scholar 

  • Locke, C. D. 1992. Software architecture for hard real-time applications: Cyclic executives vs. fixed priority executives. Journal of Real-Time Systems 4: 37–53.

    Google Scholar 

  • Mok, A. K. 1984. The design of real-time programming systems based on process models. Proc. 1984 IEEE Real-Time Systems Symposium 5–17.

  • Sha, L., Klein, M. H. and Goodenough, J. B. 1991. Rate monotonic analysis for real-time systems. In Foundations of Real-Time Computing: Scheduling and Resource Management, van Tilborg, A. M., and Koob, G. M., eds. Kluwer Academic Publishers, pp. 129–155.

  • Sha, L., Rajkumar, R. and Lehoczky, J. P. 1990. Priority inheritance protocols: An approach to real-time synchronization. IEEE Trans. on Computers 39: 1175–1185.

    Google Scholar 

  • Wilner, D. 1997. Keynote address, 1997 IEEE Real-Time Systems Symposium.

  • Xu, J. and Lam, K. 1998. Integrating run-time scheduling and pre-run-time scheduling of real-time processes. Proc. 23rd IFAC/IFIP Workshop on Real-Time Programming, Shantou, China, June.

  • Xu, J. and Parnas, D. L. 1993. On satisfying timing constraints in hard-real-time systems. IEEE Trans. on Software Engineering 19: 1–17, Jan.

    Google Scholar 

  • Xu, J. 1993. Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relations. IEEE Trans. on Software Engineering 19, Feb.

  • Xu, J. and Parnas, D. L. 1992. Pre-run-time scheduling of processes with exclusion relations on nested or overlapping critical sections. Proc. Eleventh Annual IEEE International Phoenix Conference on Computers and Communications (IPCCC-92), Scottsdale, Arizona, April 1-3.

  • Xu, J. and Parnas, D. L. 1990. Scheduling processes with release times, deadlines, precedence, and exclusion relations. IEEE Trans. on Software Engineering 16: 360–369, Mar. Reprinted in Advances in Real-Time Systems, Stankovic, J. A., and Ramamrithan, K., eds. IEEE Computer Society Press, 1993, pp. 140-149.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, J., Parnas, D.L. Priority Scheduling Versus Pre-Run-Time Scheduling. Real-Time Systems 18, 7–23 (2000). https://doi.org/10.1023/A:1008198310125

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008198310125

Navigation