Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Analyzing queueing networks with simultaneous resource possession
Communications of the ACM
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Modeling Bus Contention and Memory Interference in a Multiprocessor System
IEEE Transactions on Computers
Approximate solution of queueing networks with simultaneous resource possession
IBM Journal of Research and Development
| Hi-index | 0.00 |
Analytical methods for evaluating the performance of computer systems primarily use queueing network systems. However, those systems must verify independence assumptions that are essential to provide product-form queueing networks. We can't, therefore, directly represent some classical behaviors in computer systems, especially since the emergence of distributed systems (e.g., computer networks, multiprocessor architecture). Simultaneous resource possessions belong to those behaviors and can have a significant effect on system performances. In this paper, we study systems in which there is a common resource. This shared resource is modeled by an allocation queue with a limited number of servers. A customer obtains and holds one of the allocation servers for a first service time, then requests services inside a BCMP network while still keeping the server of the allocation queue busy. In a first part we find the value of the stability condition of those networks, then we introduce an approximate technique to evaluate those systems. Several practical examples are considered, and simulation is used to validate the analytical model and to test its robustness. The approximate results are compared with simulation and found to be very accurate.