Abstract For the Processor Sharing queue with batch job arrivals, the sojourn time W of a
single job is investigated. This queuing model is motivated by the evaluation of Cloud …

In this paper, we analyze the sojourn time of an entire batch in a M [X]/M/1 processor sharing
queue, where geometrically distributed batches arrive according to a Poisson process and …

For the $ M^{[X]}/M/1$ processor Sharing queue with batch arrivals, the sojourn time
$\Omega $ of a batch is investigated. We first show that the distribution of $\Omega $ can be …

In this paper, we consider the number of departures seen by a tagged customer while in
service in a classical M/M/1 processor sharing queue. By exploiting the underlying …

This paper considers a GI/GI/1 processor sharing queue in which jobs have soft deadlines.
At each point in time, the collection of residual service times and deadlines is modeled using …

The processor-sharing discipline was originally introduced as a modeling abstraction for the
design and performance analysis of the processing unit of a computer system. Under the …

This paper considers the sojourn time distribution in a processor-sharing queue with a
Markovian arrival process and exponential service times. We show a recursive formula to …

We study sojourn times of customers in a processor sharing queue with a service rate that
varies over time, depending on the number of customers and on the state of a random …

We analyze the single server processor-sharing queue for the case of bulk arrivals. We
obtain an expression for the expected response time of a job as a function of its size, when …

We study the Processor Sharing queueing model with a hyper-exponential service time
distribution and Poisson batch arrival process. In the case of the hyper-exponential service …