A Finite-Source Queue with Different Customers

DOI10.1145/322307.322320MaRDI QIDQ3965561zbMATH OpenOpenAlexFDO

Authors Hisao Kameda

Publication date 1982

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322307.322320

zbMATH Keywords

queueing theoryschedulingpreemptive prioritymachine interferenceperformance of computer systemsfinite-population modelmachine servicingmachine- repairman modelmodelling and evaluation of computer systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Cited in

(14)

• Analysis of various parameters of limited source queuing model having single server by using binomial and uniform distribution
• A survey of the machine interference problem
• Interrelationships between performance measures for the machine-repairman problem
• Effect of upper and lower withdrawal limits on queue length
• On the heterogeneous machine interference problem with priority and ordinary machines
• The effects of service disciplines on the performance of a nonreliable terminal system
• The efficiency of two groups of heterogeneous stations cared for by r operatives with a priority group
• Optimization problems on the performance of a nonreliable terminal system
• Heterogeneous multiprocessor systems with breakdowns: Performance and optimal repair strategies
• On the finite-source G/M/r queue
• A cyclic-service finite source model with round-robin scheduling
• A closed form solution for the G/M/r machine interference model
• A note on multi-queue scheduling of two tasks
• A simulation tool to evaluate the performance of finite-source queuing models

This page was built for publication: A Finite-Source Queue with Different Customers

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