Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The conditional sojourn time distribution in the \(GI/M/1\) processor- sharing queue in heavy traffic

From MaRDI portal
Publication:688650
Jump to:navigation, search

DOI10.1007/BF01153528zbMath0780.60097OpenAlexW2789003885MaRDI QIDQ688650

Xiaoming Tan, Charles Knessl, Yongzhi Yang

Publication date: 30 January 1994

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01153528


zbMATH Keywords

perturbation methodssojourn timeheavy traffic casequeue with a processor-sharing server


Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)


Related Items

AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue



Cites Work

  • Unnamed Item
  • The sojourn time in the GI/M/1 queue by processor sharing
  • Response-Time Distribution for a Processor-Sharing System
  • Asymptotic approximations for the gi/m/1 queue with processor-sharing service
  • Sojourn time distribution in some processor-shared queues
  • Waiting Time Distributions for Processor-Sharing Systems
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:688650&oldid=12593086"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 10:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki