Steady-state simulation of queueing processes: survey of problems and solutions
ACM Computing Surveys (CSUR)
Efficient methods of validating timing constraints
Advances in real-time systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Bounding completion times of jobs with arbitrary release times and variable execution times
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Schedulability Analysis of Acyclic Processes
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Schedulability Analysis for Tasks with Static and Dynamic Offsets
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
PERTS: A prototyping environment for real-time systems
PERTS: A prototyping environment for real-time systems
Optimal task execution times for periodic tasks using nonlinear constrained optimization
The Journal of Supercomputing
| Hi-index | 0.01 |
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.