A Cost-Equation Analysis of General-Input General-Service Processor Sharing System
From MaRDI portal
Publication:5176361
DOI10.1007/978-3-642-29210-1_82zbMath1305.68043OpenAlexW2110560921MaRDI QIDQ5176361
Yoshitaka Takahashi, Kentaro Hoshi, Naohisa Komatsu
Publication date: 3 March 2015
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29210-1_82
Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(M/G/1\) queue with processor sharing and its relation to a feedback queue
- A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications
- The sojourn time in the GI/M/1 queue by processor sharing
- An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
- Relationship between queue length and waiting time in a stationary discrete-time queue
- Time-shared Systems
- Letter to the Editor—An Alternative Proof of a Conservation Law for the Queue G/G/1
- On the relation between customer and time averages in queues
- An Analysis of the M/G/1 Queue Under Round-Robin Scheduling
This page was built for publication: A Cost-Equation Analysis of General-Input General-Service Processor Sharing System