Asymptotic analysis of a large closed queueing network with discriminatory processor sharing
From MaRDI portal
Publication:803669
DOI10.1007/BF01158797zbMATH Open0727.60106OpenAlexW2062646768MaRDI QIDQ803669FDOQ803669
Authors: John A. Morrison
Publication date: 1991
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01158797
Recommendations
- Asymptotic Analysis of the Waiting-Time Distribution for a Large Closed Processor-Sharing System
- Asymptotic analysis of spectral properties of finite capacity processor shared queues
- Asymptotic behavior of generalized processor sharing queues under subexponential assumptions
- Analysis of the queuing systems with processor sharing service discipline and random serving rate coefficients
- Asymptotic analysis of a nonuniform queueing network model of multiprocessor and multiterminal systems
- Tail asymptotics for processor-sharing queues
- Closed queue networks with load-dependent servers: An asymptotic analysis
- Queue-Length Distribution for the Discriminatory Processor-Sharing Queue
Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sharing a Processor Among Many Job Classes
- Time-shared Systems
- Title not available (Why is that?)
- Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers
- The Distribution of Queuing Network States at Input and Output Instants
- A Class of Closed Markovian Queuing Networks: Integral Representations, Asymptotic Expansions, and Generalizations*
- Complete parameterized families of job scheduling strategies
- Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes
- Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes
- Conditioned Response-Time Distribution for a Large Closed Processor-Sharing System with Multiple Classes in Very Heavy Usage
Cited In (5)
- A decomposition theorem and related results for the discriminatory processor sharing queue
- Title not available (Why is that?)
- Distribution of Processor-Sharing Customers for a Large Closed System with Multiple Classes
- Discriminatory Processor Sharing Queues and the DREB Method
- A survey on discriminatory processor sharing
This page was built for publication: Asymptotic analysis of a large closed queueing network with discriminatory processor sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803669)