Multiprocessor systems with preemptive priorities

DOI10.1016/0166-5316(81)90014-6MaRDI QIDQ3909992zbMATH OpenOpenAlexFDO

Authors P. J. B. King, I. Mitrani

Publication date 1981

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(81)90014-6

zbMATH Keywords

M/M/N queuepriority scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Cited in

(16)

• Multiprocessor systems with reserves and preferences
• Entropy maximisation and queueing network models
• Performance analysis of a hybrid switching system where voice messages can be queued
• An ME-based approximation for multi-server queues with preemptive priority
• Delay performance in stochastic processing networks with priority service.
• Approximations for Markovian multi-class queues with preemptive priorities.
• A two-queue and two-server model with a threshold-based control service policy
• A maximum entropy priority approximation for a stable G/G/1 queue
• An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities
• Performance analysis of wireless mobile networks with queueing priority and guard channels
• An Exact Analysis of the Multi‐classM/M/kPriority Queue with Partial Blocking
• 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
• Joint queue length distribution of multi-class, single-server queues with preemptive priorities
• Analysis of a finite buffer model with two servers and two nonpreemptive priority classes

This page was built for publication: Multiprocessor systems with preemptive priorities

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