Processor-Shared Time-Sharing Models in Heavy Traffic
From MaRDI portal
Publication:3757391
DOI10.1137/0215078zbMATH Open0621.68023OpenAlexW2033620577MaRDI QIDQ3757391FDOQ3757391
Authors: P. A. Jacobs, D. P. jun. Gaver 
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0215078
Recommendations
response timediffusion processprocessor sharingheavy traffic approximationMarkovian computer system model
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)
Cited In (17)
- The M/G/1 processor-sharing model: Transient behavior
- On the productivity of a processor serving two customers under a constant return time
- A study of a state-dependent job admission policy in a computer system with restricted memory partitions
- Waiting time estimates for programs in a computer with limited resources
- Time-Sharing and the DeMoivre-Laplace Theorem
- Waiting time distributions for closed \(M/M/N\) processor sharing queues
- Title not available (Why is that?)
- A mathematical model to estimate average response time of parallel programs
- Title not available (Why is that?)
- Busy Period Analysis of a Time-Sharing System
- Mathematical problems in the theory of processor-sharing queueing systems
- Title not available (Why is that?)
- The completion time of a job on multimode systems
- Sojourn time distribution in some processor-shared queues
- Conditioned Response-Time Distribution for a Large Closed Processor-Sharing System in Very Heavy Usage
- A Time-Sharing Queue
- An Approximate Analysis of a UNIX Macro Process Scheduler
This page was built for publication: Processor-Shared Time-Sharing Models in Heavy Traffic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757391)
