A cost-equation analysis of general-input general-service processor sharing system
From MaRDI portal
Recommendations
- The sojourn time in the GI/M/1 queue by processor sharing
- A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications
- Processor sharing: a survey of the mathematical theory
- Processor-sharing queues: Some progress in analysis
- GI/G/1 processor sharing queue in heavy traffic
Cites work
- A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications
- An Analysis of the M/G/1 Queue Under Round-Robin Scheduling
- An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
- scientific article; zbMATH DE number 436060 (Why is no real title available?)
- scientific article; zbMATH DE number 50996 (Why is no real title available?)
- scientific article; zbMATH DE number 3562235 (Why is no real title available?)
- scientific article; zbMATH DE number 3796940 (Why is no real title available?)
- 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
- Relationship between queue length and waiting time in a stationary discrete-time queue
- The M/G/1 queue with processor sharing and its relation to a feedback queue
- The sojourn time in the GI/M/1 queue by processor sharing
- Time-shared Systems
This page was built for publication: A cost-equation analysis of general-input general-service processor sharing system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176361)