Results 251 to 260 of about 16,132 (297)

Two-qubit logic and teleportation with mobile spin qubits in silicon. [PDF]

open access: yesNature
Matsumoto Y   +8 more
europepmc   +1 more source

Discriminatory processor sharing revisited

open access: yesProceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., 2005
As a natural multi-class generalization of the well-known (egalitarian) processor sharing (PS) service discipline, discriminatory processor sharing (DPS) is of great interest in many application areas, including telecommunications. Under DPS, the mean response time conditional on the service requirement is only known in closed form when all classes ...
K. Avrachenkov   +3 more
openaire   +4 more sources

Counterexamples to conjectures on discriminatory processor sharing and generalized processor sharing systems

Operations Research Letters, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bara Kim, Jeongsim Kim
exaly   +2 more sources

Tail asymptotics for processor-sharing queues [PDF]

open access: yesAdvances in Applied Probability, 2004
The basic queueing system considered in this paper is the M/G/1 processor-sharing queue with or without impatience and with finite or infinite capacity. Under some mild assumptions, a criterion for the validity of the reduced-service-rate approximation is established when service times are heavy tailed. This result is applied to various models based on
Guillemin, F., Robert, Ph., Zwart, A.P.
openaire   +4 more sources

A survey on discriminatory processor sharing

Queueing Systems, 2006
This paper is a summarizing article about the Discriminatory Processor Sharing (DPS) model. The characteristics of the DPS model is that all jobs present in the system are served simultaneously at rates controlled by a vector of weights \(\{g_{k}>0,\;k=1,2,\dots, K\}\); moreover, if there are \(N_{k}\) \((k=1,2,\dots, K)\) jobs of class \(k\) present ...
Eitan Altman   +2 more
exaly   +3 more sources

Batch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling

Queueing Systems, 2005
The paper investigates a processor-sharing queue with batch arrivals and Poisson arrival flow. For this queue, the expected conditional response time \(T_{\text{BPS}} (x)\) satisfies the following integral equation \[ T_{\text{BPS}}'(x) = \lambda E[N] \int_0^\infty T_{\text{BPS}}'(y) \overline {F}(x + y)\,dy+ \lambda E[N] \int_0^x T_{\text{BPS}}'(y ...
Konstantin Avrachenkov, U Ayesta
exaly   +3 more sources

The M/G/1 processor-sharing queue with disasters

open access: yesComputers and Mathematics With Applications, 2006
n this paper, the M/G/1 processor-sharing queue with disasters is given a detailed analysis by means of extending the supplementary variable method. The transient and steady-state distributions of the queue length are expressed as a simple and computable
Quan-Lin Li, Chuang Lin
exaly   +2 more sources

Home - About - Disclaimer - Privacy