Approximate analysis for heterogeneous multiprocessor systems with priority jobs

DOI10.1016/0166-5316(92)90056-MzbMath0800.68239OpenAlexW1990593432MaRDI QIDQ4031479

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

approximationcommunication networksqueueing theorymultiprocessor systemspriority job scheduling

Mathematics Subject Classification ID

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

Related Items (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