Abstract
Scheduling jobs dynamically on processors is likely to achieve better performance in multiprocessor and distributed real-time systems. Exhaustive methods for determining whether all jobs complete by their deadlines, in systems that use modern priority-driven scheduling strategies, are often infeasible or unreliable since the execution time of each job may vary. We previously published research results on finding worst-case bounds and efficient algorithms for validating systems in which independent jobs have arbitrary release times and deadlines, and are scheduled on processors dynamically in a priority-driven manner. An efficient method has been proposed to determine how late the completion times of jobs can be in dynamic systems where the jobs are preemptable and nonmigratable. This paper further presents the performance characteristics of the proposed methods, and shows its soundness by providing extensive simulation results. The worst-case completion times of jobs obtained with the proposed methods are compared with the values by simulations under different workload characteristics. The simulation results show that the proposed algorithm performs considerably well for diverse workloads. Considering the previous work showed the unlikelihood of finding tighter bounds than the one given in the paper, the simulation results indicate that the proposed methods effectively constitute a theoretical basis needed for a comprehensive validation strategy that is capable of dealing with dynamic distributed real-time systems.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the Association for ComputingMachinery, 20(1):46–61, 1973.
J. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation, 2:237–250, 1982.
B. Sprunt, L. Sha, and J. P. Lehoczky. Aperiodic task scheduling for hard-real-time systems. The Journal of Real-Time Systems, 1:27–60, 1989.
J. P. Lehoczky, L. Sha, and Y. Ding. The rate monotone scheduling algorithm: exact characterization andaverage case behavior. In Proceedings of IEEE 10th Real-Time Systems Symposium, pp. 166–171, December 1989.
L. Sha, R. Rajkumar, and J. P. Lehoczky. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers, 39(9):1175–1185, 1990.
T. P. Baker. A stack-basedallocation policy for realtime processes. In Proceedings of IEEE 11th Real-Time Systems Symposium, pp. 191–200, December 1990.
C. Han and H. Tyan. A better polynomial-time schedulability test for teal-time fixed-priority scheduling algorithms, In Proceedings of IEEE 18th Real-Time Systems Symposium, pp. 36–45, December 1997.
J. C. Palencia and M. Gonzalez Harbour. Schedulability analysis for tasks with static andd ynamic offsets, In Proceedings of IEEE 19th Real-Time Systems Symposium, pp. 26–37, December 1998.
J. Sun and J. W. S. Liu. Bounding completion times of jobs with arbitrary release times andvariable execution times. In Proceedings of IEEE 17th Real-Time Systems Symposium, pp. 2–12, December 1996.
M. J. Meyer and H. Wong-Toi. Schedulability analysis of acyclic processes, In Proceedings of IEEE 19th Real-Time Systems Symposium, pp. 274–283, December 1998.
J. W. S. Liu, J. Redondo, Z. Deng, T. Tia, R. Bettati, A. Silberman, M. Storch, R. Ha, and W. Shih. PERTS: A prototyping environment for real-time systems. Technical Report UIUCDCS-R–93–1802, University of Illinois at Urbana-Champaign, 1993.
J. Blazewicz. Selectedtopics in scheduling theory. Annals of Discrete Mathematics, 31:1–60, 1987.
J. W. S. Liu and R. Ha. Theoretical foundations of efficient methods for validating real-time constraints. In S. Son, ed., Principles of Real-Time Systems, pp. 199–223, Prentice Hall, 1995.
R. Ha, H. Cha, and J. W. S. Liu. Validating real-time constraints in heterogeneous multiprocessor andd istributedsystems. Journal of Systems Integration, 9:207–222, 1999.
K. Pawlikowski. Steady-state simulation of queueing processes: a survey of problems and solutions. ACM ComputingSurveys, 22(2):123–170, 1990.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cha, H., Ha, R. & Liu, J.W.S. Experimental Analysis of Timing Validation Methods for Distributed Real-Time Systems. The Journal of Supercomputing 25, 73–94 (2003). https://doi.org/10.1023/A:1022804303992
Issue Date:
DOI: https://doi.org/10.1023/A:1022804303992