Algorithms for nonintegral degrees of multiprogramming in closed queuing networks

DOI10.1016/0166-5316(84)90023-3MaRDI QIDQ3318503zbMATH OpenOpenAlexFDO

Authors Lawrence W. Dowdy, Karen D. Gordon

Publication date 1984

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(84)90023-3

zbMATH Keywords

computational complexitymean value analysisclosed queueing networkscomputation of performance measuresdegree of multi-programmingmulti-class algorithmsnon- integral valuesnormalization constant methods

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• An Analysis Of Closed Queueing Networks With Product Form Solution
• PAM—A noniterative approximate solution method for closed multichain queueing networks
• A Fixed-Point Algorithm for Closed Queueing Networks
• scientific article; zbMATH DE number 3982236
• On a class of approximations for closed queueing networks

Cited in

(2)

• PDAC: A data parallel algorithm for the performance analysis of closed queueing networks
• An Analysis Of Closed Queueing Networks With Product Form Solution

This page was built for publication: Algorithms for nonintegral degrees of multiprogramming in closed queuing networks

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