In this work we perform extensive simulation studies to evaluate the mean packet waiting time in a system composed of two queues and Earliest Deadline First scheduler with different deadline distributions. The investigation is focused on the analysis of mean packet delays when deterministic and exponentially distributed deadline values are used. Comparing the results is targeted at deciding if the analytical approach proposed in our earlier work for modelling performance of Earliest Deadline First scheduler with exponentially distributed deadline values is also suitable when deadline values are deterministic. The series of simulation tests let us conclude the conditions when both deadline distributions produce very close results thus confirming the applicability of our already published analytical approach.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.