We investigate deadline meeting properties of the well-known (preemptive) static priority scheduling (SPS) algorithm, which is widespreadly used in commercial real-time operating system kernels. A discrete-time single server queueing system employing SPS for scheduling probabilistically arriving tasks at L priority levels is considered for this purpose. Model parameters are arrival and execution-time distribution A
Nima HomayounParameswaran Ramanathan
Jongwon LeeSungyoung LeeHyungill Kim