Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics
Journal of the ACM (JACM)
Discrete-time control systems
Congestion probabilities in a circuit-switched integrated services network
Performance Evaluation
Numerical analysis: mathematics of scientific computing
Numerical analysis: mathematics of scientific computing
Analysis of dynamic congestion control protocols: a Fokker-Planck approximation
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Design and Analysis of Master/Slave Multiprocessors
IEEE Transactions on Computers
Parallel database systems: the future of high performance database systems
Communications of the ACM
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Analysis of a fluid approximation to flow control dynamics
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Distributed computing feasibility in a non-dedicated homogeneous distributed system
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Computational complexity of loss networks
Theoretical Computer Science - Special issue on probabilistic modelling
Routing and Dimensioning in Circuit-Switched Networks
Routing and Dimensioning in Circuit-Switched Networks
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Sensitivity analysis of a superscalar processor model
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
Hi-index | 0.00 |
Multiple-class multiple-resource (MCMR) systems, where each class of customers requires a particular set of resources, are common. These systems are often analyzed under steady-state conditions. We describe a simple method, referred to as Z-iteration, to estimate both transient and steady-state performances of such systems. The method makes use of results and techniques available from queueing theory, network analysis, dynamic flow theory, and numerical analysis. We show the generality of the Z-iteration by applying it to an ATM network, a parallel disk system, and a distributed batch system. Validations against discrete-event simulations show the accuracy and computational advantages of the Z-iteration.