Optimization of Priority Class Queues, with a Computer Center Case Study

DOI10.1080/01966324.1981.10737079MaRDI QIDQ3318510zbMATH OpenOpenAlexWikidataFDO

Authors F. Keyzer, E. Mullenders, A. J. van Reeken, Jack P. C. Kleijnen

Publication date 1981

Published in American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01966324.1981.10737079

zbMATH Keywords

quantileregression modelssearch algorithmtwo serverscomputer managementkey-punchingthree priority classes

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Theory of software (68N99) Theory of operating systems (68N25)

Recommendations

• Characterization and Optimization of Achievable Performance in General Queueing Systems
• scientific article; zbMATH DE number 3962929
• Optimal priority assignment with hard constraint
• Optimization in a class of priority-discarding policies for finite queues
• Technical Note—On Rothkopf and Smith's Statement Regarding Optimal Priority Assignment

Cites work

• scientific article; zbMATH DE number 3141625 (Why is no real title available?)
• scientific article; zbMATH DE number 3495530 (Why is no real title available?)
• scientific article; zbMATH DE number 3254517 (Why is no real title available?)
• An introduction to the regenerative method for simulation analysis
• Priority queues
• Two-dimensional packing: expected performance of simple level algorithms

Cited in

(3)

• Importance of verifying queue model assumptions before planning with simulation software
• Statistical analysis of steady-state simulations: Survey of recent progress
• Efficiency of combining various priority queueing disciplines in computer systems

This page was built for publication: Optimization of Priority Class Queues, with a Computer Center Case Study

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