ACM Transactions on Computer Systems (TOCS)
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)
Interference in multiprocessor computer systems with interleaved memory
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
A performance evaluation of the multiple bus network for multiprocessor systems
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
An approximate analysis of multiprocessor systems
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
On the Analysis of Memory Conflicts and Bus Contentions in a Multiple-Microprocessor 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 Memory Interference in Multiprocessors
IEEE Transactions on Computers
Performance Analysis Using Stochastic Petri Nets
IEEE Transactions on Computers
A General Model for Memory Interference in Multiprocessors
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
| Hi-index | 0.00 |
Generalized stochastic Petri net (GSPN) models are used to analyze the performance of a class of multiplebus multiprocessor systems. Exploiting the unusual simplicity of the state space of the Markov chains derived by firing the reachability graphs of the GSPNs, these models are shown to admit a product-form solution, despite the presence of passive resources. This result is supported by the formal proof of the local balance property in the case of two-bus systems; moreover, the local balance property was numerically proved to hold for systems comprising up to ten processors and five buses. Flow-equivalent expressions are derived for the cases of two and three buses using a stage-aggregation technique. This method dramatically reduces the computational complexity of the model solution as compared with the standard solution of the original Markov chain, thus making the exact analysis of very large systems both practical and inexpensive.