Processor-sharing queues: Some progress in analysis
type: Item
instance of: scholarly article
title: Processor-sharing queues: Some progress in analysis
zbMATH Open document ID: 0648.68050
DOI: 10.1007/BF01182931
author: S. F. Yashkov
published in: Queueing Systems
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 4058858
zbMATH Keywords: queue length
zbMATH Keywords: response time
zbMATH Keywords: time sharing
zbMATH Keywords: processor-sharing queueing systems
zbMATH Keywords: sojourn time distributions
zbMATH Keywords: M/G/1/\(\infty \) queue
MaRDI profile type: Publication
cites work: Conditional response times in the M/G/1 processor-sharing system
cites work: Q3333844
cites work: M/G/\(\infty\) tandem queues
cites work: Approximations of the Mean Waiting Time in an M/G/s Queueing System
cites work: Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem
cites work: Waiting Time Distributions for Processor-Sharing Systems
cites work: Q3938929
cites work: On processor sharing and random service
cites work: Q3662408
cites work: Brownian Excursion, the M/M/1 Queue and Their Occupation Times
cites work: Q3946848
cites work: Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO
cites work: Queueing Networks: A Survey of Their Random Processes
cites work: Sharing a Processor Among Many Job Classes
cites work: Q3678435
cites work: Performance evaluation studies for time-sharing computer systems
cites work: Conditional expected sojourn times in insensitive queueing systems and networks
cites work: Q3906873
cites work: Q4134686
cites work: Time-Sharing Service Systems. I
cites work: Queueing Models for Computer Communications System Analysis
cites work: Q5572722
cites work: Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes
cites work: Response-Time Distribution for a Processor-Sharing System
cites work: Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes
cites work: Direct Solutions of M/G/1 Processor-Sharing Models
cites work: The sojourn-time distribution in the M/G/1 queue by processor sharing
cites work: Q3952958
cites work: Q3900799
cites work: The sojourn time in the GI/M/1 queue by processor sharing
cites work: Q3946929
cites work: An Analysis of the M/G/1 Queue Under Round-Robin Scheduling
cites work: On the response time distribution in a discrete round-robin queue
cites work: A new approach to the M/G/1 processor-sharing queue
cites work: The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue
cites work: Q3713599
cites work: Q3321201
cites work: Q3657753
cites work: Q3668866
cites work: Q3690209
cites work: Q3705195
cites work: Q3738889
full work available at URL: https://doi.org/10.1007/bf01182931
OpenAlex ID: W2067707013
Recommended article: Q3979296
Recommended article: On the transient behavior of the processor sharing queue
Recommended article: Throughput in Processor-Sharing Queues
Recommended article: A note on the event horizon for a processor sharing queue
Recommended article: On Finite Capacity Processor-Shared Queues
Recommended article: Tail asymptotics for processor-sharing queues
Recommended article: Analysis of the M/G/1 processor-sharing queue with bulk arrivals
Recommended article: Q3346054
Recommended article: On differential equations arising in the theory of processor sharing queues
description: scientific article; zbMATH DE number 4058858