Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
