Analysing Multiprogramming Queues by Generating Functions

DOI10.1137/0153056MaRDI QIDQ3142785zbMATH OpenOpenAlexFDO

Authors Ivo Adan, J. Wessels, W. H. M. Zijm

Publication date 30 January 1994

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/analysing-multiprogramming-queues-by-generating-functions(7430c847-dab8-424c-8768-b7c1ea808eb1).html

zbMATH Keywords

equilibrium probabilitiesgenerating functionmultiprogramming modelqueueing systemsshortest-queue problem

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• Performance bounds for queues via generating functions
• Analyzing \(GI/E_ r/1\) queues
• Analytic Queueing Models for Programs with Internal Concurrency
• A general approach to queuing in C.S.P
• An approximate analysis for a class of assembly-like queues
• Analysis of queues. Methods and applications
• Processor-sharing queues: Some progress in analysis
• Priority queueing systems: from probability generating functions to tail probabilities

Cited in

(3)

• scientific article; zbMATH DE number 1796951 (Why is no real title available?)
• On some functional equations with applications in networks
• A compensation procedure for multiprogramming queues

This page was built for publication: Analysing Multiprogramming Queues by Generating Functions

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