On EDF scheduler with the exponential deadlines

Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki

Andrzej Janowski¹  Robert Janowski² 

[1] ;Warsaw School of Computer Science;

关键词: earliest deadline first;    scheduling;    performance evaluation;    markov chains;   

DOI  :  10.26348/znwwsi.15.7

来源: DOAJ

【 摘 要 】

This work deals with the performance evaluation of EDF (Earliest Deadline First) packet scheduler with two classes. The primary metric of interest is the mean sojourn time for each class. The system is composed of two classes (two queues) with Poisson input to each of them, deterministic service times and exponentially distributed deadline values. The model is analysed as an embedded Markov chain at the instants of packet departures from the service. The solution i.e. the joint probability distribution of the number of packets in each queue is obtained using the matrix approach. The metrics such as the mean sojourn time or the mean number of packets in the system for each class are directly obtained from this joint probability distribution.

【 授权许可】

Unknown