Pages that link to "Item:Q1105368"
From MaRDI portal
The following pages link to Processor-sharing queues: Some progress in analysis (Q1105368):
Displaying 45 items.
- Queuing system with processor sharing and limited resources (Q612031) (← links)
- SEH: size estimate hedging for single-server queues (Q832066) (← links)
- SRPT applied to bandwidth-sharing networks (Q839852) (← links)
- On mathematical models of the service networks (Q845460) (← links)
- On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes (Q845476) (← links)
- \(M/G/1/\mathrm{MLPS}\) compared with \(M/G/1/\mathrm{PS}\) within service time distribution class IMRL (Q857944) (← links)
- Tail behavior of conditional sojourn times in processor-sharing queues (Q877791) (← links)
- Mathematical theory of queueing networks (Q913640) (← links)
- Processor sharing: a survey of the mathematical theory (Q927561) (← links)
- Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue (Q966424) (← links)
- Waiting times for \(M/M\) systems under state-dependent processor sharing (Q1025610) (← links)
- A single server queue with gated processor-sharing discipline (Q1122881) (← links)
- A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline (Q1176447) (← links)
- The \(M/G/1\) queue with processor sharing and its relation to a feedback queue (Q1177917) (← links)
- Mathematical problems in the theory of processor-sharing queueing systems (Q1179867) (← links)
- On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers (Q1298741) (← links)
- The M/G/1 processor-sharing model: Transient behavior (Q1319842) (← links)
- A decomposition theorem and related results for the discriminatory processor sharing queue (Q1342958) (← links)
- Analysis of the M/G/1 processor-sharing queue with bulk arrivals (Q1400352) (← links)
- The equivalence between processor sharing and service in random order. (Q1413911) (← links)
- Stability of an M\(|G|1\) queue with thick tails and excess capacity (Q1585947) (← links)
- The customer response times in the processor sharing queue are associated (Q1813543) (← links)
- On the M/G/1 foreground-background processor-sharing queue (Q1825530) (← links)
- Diffusion approximation for a processor sharing queue in heavy traffic. (Q1879882) (← links)
- Waiting time distributions for closed \(M/M/N\) processor sharing queues (Q1896708) (← links)
- On the Gittins index in the M/G/1 queue (Q2269488) (← links)
- On energy-aware \(M/G/1\)-LAS queue with batch arrivals (Q2294391) (← links)
- Heavy traffic limit for a processor sharing queue with soft deadlines (Q2456052) (← links)
- Explicit formulas for the variance of conditioned sojourn times in \(M/D/1\)-PS (Q2457262) (← links)
- Place reservation: Delay analysis of a novel scheduling mechanism (Q2471221) (← links)
- The \(M/G/1\) processor-sharing queue with disasters (Q2475887) (← links)
- Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue (Q2479860) (← links)
- Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals (Q2481137) (← links)
- \(M/G/1/MLPS\) compared to \(M/G/1/PS\) (Q2488205) (← links)
- Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue (Q2494557) (← links)
- Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates (Q2494558) (← links)
- Sojourn time asymptotics in processor-sharing queues (Q2494559) (← links)
- A survey on discriminatory processor sharing (Q2494560) (← links)
- Sojourn times in the \(M/ PH/1\) processor sharing queue (Q2572901) (← links)
- Batch arrival processor-sharing with application to multi-level processor-sharing scheduling (Q2572914) (← links)
- SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING (Q2746240) (← links)
- PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING (Q3100879) (← links)
- On the nonoptimality of the foreground-background discipline for IMRL service times (Q3410931) (← links)
- Processor-sharing and random-service queues with semi-Markovian arrivals (Q5697596) (← links)
- A foreground-background queueing model with speed or capacity modulation (Q6135889) (← links)