A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study

This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. the service discipline in the queue is earliestdeadline-first (edf), which is an optimal scheduling algorithm. real-time jobs withexponentially distributed relative deadlines arrive according to a poisson process. all jobs have deadlines until the end of service and are served non-preemptively. an important performance measure to calculate is the loss probability. the performance of the system is approximated bya markovian model in the long run. a key parameter, namely, the loss rate when there are n jobs in the system is used in the model, which is estimated by partitioning the system into two subsystems. the resulting model can then be solved analytically using standard markoviansolution techniques. the number of servers in the system may change due to failure or repair.the performability of the system is evaluated in the presence of such structural changes. the latter measure is approximated by a markov reward model, considering the loss probability as the reward rate. comparing numerical and simulation results, we find that the existing errors are relatively small.