Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Product Form and Local Balance in Queueing Networks
Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
Queuing Network Models with State-Dependent Routing
Journal of the ACM (JACM)
Approximate Methods for Analyzing Queueing Network Models of Computing Systems
ACM Computing Surveys (CSUR)
Computational algorithms for product form queueing networks
Communications of the ACM
A comparison of numerical techniques in Markov modeling
Communications of the ACM
Memory management and response time
Communications of the ACM
Decomposability, instabilities, and saturation in multiprogramming systems
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
Computer system models with passive resources.
Computer system models with passive resources.
Analytic Queueing Models for Programs with Internal Concurrency
IEEE Transactions on Computers
Queueing systems with resource sharing
Journal of Systems and Software
| Hi-index | 0.01 |
Queueing networks are important as Performance models of computer and communication systems because the performance of these systems is usually principally affected by contention for resources. Exact numerical solution of a queueing network is usually only feasible if the network has a product form solution in the sense of Jackson. An important network characteristic which apparently precludes a product form solution is simultaneous resource possession, e.g., a job holds memory and processor simultaneously. This paper extends previous methods for approximate numerical solution of queueing networks with homogeneous jobs and simultaneous resource possession to networks with heterogeneous jobs and simultaneous resource possession.