Abstract
Scheduling algorithms are proposed for a computational process in single-processor real-time systems. Time it takes to execute the tasks is assumed to be known imprecisely and is given by a time interval, which leads to imprecise task timing (jitter).
Similar content being viewed by others
References
Liu, J.W.S., Real-Time Systems, Prentice Hall, Engle-wood Cliffs, NJ, 2000.
Conway, R.W., Maxwell, W.L., and Miller, L.W., Theory of Scheduling, Addison-Wesley, Reading, 1967.
Computer and Task-Shop Scheduling Theory, Coffman, E.G., Ed., Wiley, 1976.
Liu, C. and Layland, J.W., Scheduling algorithms for multiprogramming in a hard real-time environment, Journal ACM, 1973, vol. 20, no. 1, pp. 46–61.
Cottet, F., Kaiser, J., and Mammeri, Z., Scheduling in Real-Time Systems, Hoboken, New Jersey: Wiley, 2002.
Cheng, A.M.K., Real-Time Systems. Scheduling, Analysis, and Verification, Wiley, 2002.
Stankovic, J.A., Spuri, M., Ramemritham, K., and Buttazzo, G.C., Deadline Scheduling for Real-Time Systems, London: Kluwer, 1998.
Gendy, A.K. and Pont, M.J., Automatically configuring time-triggered schedulers for use with resourceconstrained, single-processor embedded systems, IEEE Trans. Industrial Informatics, 2008, vol. 4, no. 1, pp. 37–46.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © N.V. Kolesov, M.V. Tolmacheva, P.V. Yukhta, 2014, published in Programmirovanie, 2014, Vol. 40, No. 1.
Rights and permissions
About this article
Cite this article
Kolesov, N.V., Tolmacheva, M.V. & Yukhta, P.V. Jitter minimization in scheduling computations in real-time systems. Program Comput Soft 40, 28–34 (2014). https://doi.org/10.1134/S0361768814010058
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0361768814010058