S.F. Yashkov

The M/D/1 Processor Sharing Queue Revisited

Starting from previous results of studying the M/G/1 queue with egalitarian processor sharing (EPS), we consider a special case: the M/D/1---EPS, and show how to obtain the (conditional) sojourn time distribution for this special case from more general results. Some new properties of such queues are discovered. We also establish some connections between the M/D/1---EPS queue and some known results from geometrical probability and uniform spacings.

КЛЮЧЕВЫЕ СЛОВА: processor sharing, geometrical probability