Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
Numerical methods for scientists and engineers (2nd ed.)
Numerical methods for scientists and engineers (2nd ed.)
Propeties of storage hierarchy systems with multiple page sizes and redundant data
ACM Transactions on Database Systems (TODS)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Optimal Design of Linear Storage Hierarchies
Journal of the ACM (JACM)
Guest Editor's Overview… Queuing Network Models of Computer System Performance
ACM Computing Surveys (CSUR)
The Operational Analysis of Queueing Network Models
ACM Computing Surveys (CSUR)
The impact of distributions and disciplines on multiple processor systems
Communications of the ACM
Models for parallel processing within programs: application to CPU: I/O and I/O: I/O overlap
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
A Validated Distributed System Performance Model
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
Studies in Markov models of computer systems
ACM '75 Proceedings of the 1975 annual conference
STORAGE HIERARCHY SYSTEMS
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
| Hi-index | 0.00 |
A performance analysis methodology using certain aspects of queueing theory to evaluate computer system speed performance is presented. This methodology specifically focuses on modeling multiprocessor computer systems with unbalanced flows (i.e., number of transactions leaving a server is not the same as number of transactions entering that server) due to asynchronously spawned parallel tasks. This unbalanced flow phenomenon, which has a significant effect on performance, cannot be solved analytically by classical queueing network models.A decomposition method is applied to decompose the unbalanced flows. Formulae for open queueing networks with unbalanced flows due to asynchronously spawned tasks are developed. Furthermore, an algorithm based on Buzen's convolution algorithm is developed to test the necessary and sufficient condition for closed system stability as well as to compute performance measures. An average of less than four iterations is reported for convergence with this algorithm.A Study of the INFOPLEX multiprocessor data storage hierarchy, comparing this rapid solution algorithm with simulations, has shown highly consistent results. A cost effective software tool, using this methodology, has been developed to analyze an architectural design, such as INFOPLEX, and to produce measures such as throughput, utilization, and response time so that potential performance problems can be identified.