Modeling a Multiprocessor System with Preemptive Priorities

DOI10.1287/MNSC.37.2.185MaRDI QIDQ3358217zbMATH OpenOpenAlexFDO

Authors Edward P. C. Kao, Kumar S. Narayanan

Publication date 1991

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.37.2.185

zbMATH Keywords

Markovian systemsmatrix-geometric modelsmultiserver priority queues

Mathematics Subject Classification ID

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

Recommendations

• Analysis of nonpreemptive priority queues with multiple servers and two priority classes
• Computing Steady-State Probabilities of a Nonpreemptive Priority Multiserver Queue
• An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities
• Multiprocessor systems with reserves and preferences
• scientific article; zbMATH DE number 4039611

Cited in

(8)

• Modeling of priorityless processing in an interleaved memory with a perfectly informed processor
• Multiprocessor systems with reserves and preferences
• Using state reduction for computing steady state vectors in Markov chains of \(M/G/1\) type
• Waiting time analysis of a two-stage queueing system with priorities
• Delay performance in stochastic processing networks with priority service.
• MULTI-CLASS RESOURCE SHARING WITH PREEMPTIVE PRIORITIES
• A foreground-background queueing model with speed or capacity modulation
• Multi-server queueing systems with multiple priority classes

This page was built for publication: Modeling a Multiprocessor System with Preemptive Priorities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358217)