Queueing networks with blocking
Queueing networks with blocking
Mean value analysis for queueing network models with intervals as input parameters
Performance Evaluation
Performance evaluation of an enterprise JavaBean server implementation
Proceedings of the 2nd international workshop on Software and performance
Interval parameters for capturing uncertainties in an EJB performance model
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance Engineering of Software Systems
Performance Engineering of Software Systems
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Stability of Feature Selection Algorithms
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Performance of two-stage tandem queues with blocking: the impact of several flows of signals
Performance Evaluation
| Hi-index | 0.00 |
We consider a form of blocking, which is typical in client-server systems including those implemented under the Enterprise JavaBean (EJB) specification. The novel feature is that tasks must wait for one of a number of parallel queues to clear its outstanding work. Thus, blocking time is the minimum of sojourn times at the parallel queues. Under certain simplifying assumptions, we solve this model for the probability distribution of blocking time and obtain a simple formula for its mean value. We then use this result in an aggregate server model of a larger queueing network in which further non-standard techniques are included to represent this form of blocking. We compare our approximate results against simulation data, obtaining good agreement for both system throughput and queue length probability distributions at equilibrium.