default search action
SIGMETRICS Performance Evaluation Review, Volume 12
Volume 12, Number 1, Winter 1982-1983
- J. P. Marrevée:
The Power of the Read Track and The Need for a Write Track Command for Disk Back-Up and Restore Utilities. 10-14 - Harry G. Perros:
A Model for Predicting the Response Time of an On-Line System for Electronic Fund Transfer. 15-21 - Reinhard Augustin, Klaus-Jürgen Büscher:
Characteristics of the COX-Distribution. 22-32
Volume 12, Number 2, Spring-Summer 1984
- Harry G. Perros:
Queueing Networks with Blocking: A Bibliography. 8-12 - Tom DeMarco:
An Algorithm for Sizing Software Products. 13-22 - Paul A. Fishwick, Stefan Feyock:
Profgen: A Procedure for Generating Machine Independent High-Level Language Profilers. 27-31 - M. K. Rajaraman:
Performance Measures for a Local Network. 34-37 - Greg A. Jones:
Performance Evaluation of a Job Scheduler. 38-43 - Jon D. Clark, Thomas C. Richards:
A Note on the Cost-Performance Ratios of IBM's 43XX Series. 44-45
Volume 12, Number 3, August 1984
- Herbert D. Schwetman, James P. Bouhana, Ray Bryant:
Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems, Cambridge, Massachusetts, USA, August 21-24, 1984. ACM 1984, ISBN 0-89791-141-5 [contents]
Volume 12, Number 4, Winter 1984-1985
- John E. Gaffney Jr.:
Instruction Entropy, A Possible Measure of Program/Architecture Compatibility. 13-18 - Charles H. Sauer:
Numerical Solution of Some Multiple Chain Queueing Networks. 19-28 - Alexander Thomasian, Kameshwar Gargeya:
Speeding up Computer System Simulations Using Hierarchical Modeling. 34-39 - James L. Elshoff:
The Peek Measurement Program. 40-53 - Anna Hac:
A Survey of Techniques for the Modeling of Serialization Delays in Computer Systems. 54-56
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.