Search Results - subject:"Processor sharing"

The Concert Queueing Game: Fluid Regime with Random Order Service

Juneja, Sandeep; Raheja, Tushar - In: International Game Theory Review (IGTR) 17 (2015) 02, pp. 1540012-1

random order service (ROS). This is equivalent to the practically equally important processor sharing regime when the service …

Persistent link: https://www.econbiz.de/10011279151

The concert queueing game : fluid regime with random order service

Juneja, Sandeep; Raheja, Tushar - In: International game theory review 17 (2015) 2, pp. 1-15

Persistent link: https://www.econbiz.de/10010528400

On spectral properties of finite population processor shared queues

Zhen, Qiang; Knessl, Charles - In: Computational Statistics 77 (2013) 2, pp. 147-176

We consider sojourn or response times in processor-shared queues that have a finite population of potential users. Computing the response time of a tagged customer involves solving a finite system of linear ODEs. Writing the system in matrix form, we study the eigenvectors and eigenvalues in the...

Persistent link: https://www.econbiz.de/10010847947

On spectral properties of finite population processor shared queues

Zhen, Qiang; Knessl, Charles - In: Mathematical Methods of Operations Research 77 (2013) 2, pp. 147-176

Persistent link: https://www.econbiz.de/10010999948

Построение модели данных для автоматизированной системы проектирования городской инфраструктуры // The construction of data model for automated design of urban infrastructure

Maksimov, D.A.; Moshkin, I.V. - In: The Russian Academic Journal 25 (2013) 3

Статья посвящена решению проблемы передачи данных между различными системами на примере проектирования городской инфраструктуры. Актуальность статьи...

Persistent link: https://www.econbiz.de/10011250834

Asymptotic expansions of defective renewal equations with applications to perturbed risk models and processor sharing queues

Blanchet, Jose; Zwart, Bert - In: Mathematical Methods of Operations Research 72 (2010) 2, pp. 311-326

expansions are applied to the analysis of processor sharing queues and perturbed risk models, and yield approximations that can …

Persistent link: https://www.econbiz.de/10010950283

On a processor sharing queue that models balking

Zhen, Qiang; Leeuwaarden, Johan; Knessl, Charles - In: Mathematical Methods of Operations Research 72 (2010) 3, pp. 453-476

We consider the processor sharing M/M/1-PS queue which also models balking. A customer that arrives and sees n others …

Persistent link: https://www.econbiz.de/10010999585

Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue

Zhen, Qiang; Knessl, Charles - In: Mathematical Methods of Operations Research 71 (2010) 2, pp. 201-244

We consider the M/G/1 queue with a processor sharing server. We study the conditional sojourn time distribution …

Persistent link: https://www.econbiz.de/10010999743

On a processor sharing queue that models balking

Zhen, Qiang; Leeuwaarden, Johan; Knessl, Charles - In: Computational Statistics 72 (2010) 3, pp. 453-476

We consider the processor sharing M/M/1-PS queue which also models balking. A customer that arrives and sees n others …

Persistent link: https://www.econbiz.de/10010759182

Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue

Zhen, Qiang; Knessl, Charles - In: Computational Statistics 71 (2010) 2, pp. 201-244

We consider the M/G/1 queue with a processor sharing server. We study the conditional sojourn time distribution …

Persistent link: https://www.econbiz.de/10010759338