Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
Approximate Methods for Analyzing Queueing Network Models of Computing Systems
ACM Computing Surveys (CSUR)
Linearizer: a heuristic algorithm for queueing network models of computing systems
Communications of the ACM
Analyzing queueing networks with simultaneous resource possession
Communications of the ACM
A model of shared DASD and multipathing
Communications of the ACM
Computational algorithms for product form queueing networks
Communications of the ACM
Interference in multiprocessor computer systems with interleaved memory
Communications of the ACM
A Reduction Technique for Evaluating Queueing Networks with Serialization Delays
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
An approximate analysis of multiprocessor systems
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
An analysis of the instruction execution rate in certain computer structures
An analysis of the instruction execution rate in certain computer structures
On the Analysis of Memory Conflicts and Bus Contentions in a Multiple-Microprocessor System
IEEE Transactions on Computers
Modeling Bus Contention and Memory Interference in a Multiprocessor System
IEEE Transactions on Computers
Interference in Multiprocessor Systems with Localized Memory Access Probabilities
IEEE Transactions on Computers
Markov Models for Multiple Bus Multiprocessor Systems
IEEE Transactions on Computers
Analysis of Multiprocessors with Private Cache Memories
IEEE Transactions on Computers
Analysis of Memory Interference in Multiprocessors
IEEE Transactions on Computers
Interleaved Memory Bandwidth in a Model of a Multiprocessor Computer System
IEEE Transactions on Computers
A General Model for Memory Interference in Multiprocessors
IEEE Transactions on Computers
Memory Interference in Synchronous Multiprocessor Systems
IEEE Transactions on Computers
Comparative Performance Analysis of Single Bus Multiprocessor Architectures
IEEE Transactions on Computers
Bandwidth of Crossbar and Multiple-Bus Connections for Multiprocessors
IEEE Transactions on Computers
Performance analysis of future shared storage systems
IBM Journal of Research and Development
Modeling the Effect of Redundancy on Yield and Performance of VLSI Systems
IEEE Transactions on Computers
| Hi-index | 14.98 |
Two classes of approximate models are developed for multiprocessor systems containing P processors, M memories, and B buses. One class of models is based on the flow equivalence technique for the approximate analysis of queueing networks. A memory invariance principle is presented and used to obtain the parameters of this model. This approach is used to model homogeneous processor systems where memory times are either constant or exponentially distributed random variables. The second class of models is based on the method of surrogate delays also commonly used in the approximate analysis of queueing networks. This approach produces an iterative algorithm which can be used to evaluate heterogeneous systems with exponential memory times. The accuracy of both classes of models is evaluated through simulation. Lastly, as a byproduct of these models, an algorithm is presented with which to determine the distribution of the number of nonempty service centers in a product form queueing network.