The Community for Technology Leaders
14th International Conference on Distributed Computing Systems (1994)
Pozman, Poland
June 21, 1994 to June 24, 1994
ISBN: 0-8186-5840-1
pp: 162-171
Rhan Ha , Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
J.W.S. Liu , Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
ABSTRACT
In multiprocessor and distributed real-time systems, scheduling jobs dynamically on processors is likely to achieve better performance. However, analytical and efficient validation methods to determine whether all the timing constraints are met do not exist for systems using modern dynamic scheduling strategies, and exhaustive simulation and testing are unreliable and expensive. This paper describes several worst-case bounds and efficient algorithms for validating systems in which jobs have arbitrary timing constraints and variable execution times and are scheduled on processors dynamically in a priority-driven manner. The special cases of the validation problem considered here are concerned with independent jobs that are (1) preemptable and migratable, or (2) preemptable and nonmigratable, or (3) nonpreemptable.<>
INDEX TERMS
scheduling, real-time systems, distributed processing, resource allocation, network operating systems
CITATION

Rhan Ha and J. Liu, "Validating timing constraints in multiprocessor and distributed real-time systems," 14th International Conference on Distributed Computing Systems(ICDCS), Pozman, Poland, 1994, pp. 162-171.
doi:10.1109/ICDCS.1994.302407
83 ms
(Ver 3.3 (11022016))