Approximate analysis for heterogeneous multiprocessor systems with priority jobs

DOI10.1016/0166-5316(92)90056-MMaRDI QIDQ4031479zbMATH OpenOpenAlexFDO

Authors Takeshi Nishida

Publication date 1 April 1993

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(92)90056-m

zbMATH Keywords

queueing theoryapproximationcommunication networksmultiprocessor systemspriority job scheduling

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18) Computer system organization (68M99)

Cited in

(3)

• Transient solution of a two-processor heterogeneous system
• Analysis of \(M/M/1\) queueing system with two priority classes
• Multi-server queueing systems with multiple priority classes

This page was built for publication: Approximate analysis for heterogeneous multiprocessor systems with priority jobs

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