Previous Table of Contents Next


REFERENCES

Adam, N. R. and Dogramaci, A., Eds. (1979). Current Issues in Computer Simulation, Academic Press, New York.

Agrawal, S. C. (1985). Metamodeling. A Study of Approximations in Queueing Models, MIT Press, Cambridge, MA.

Agrawala, A. K., Mohr, J. M., and Bryant, R. M. (1976). An Approach to the Workload Characterization Problem, Computer, 9(6), 18–31.

Agrawala, A. K. and Mohr, J. M. (1977). Some Results on the Clustering Approach to Workload Modeling, Proc. CPEUG’77, New Orleans, LA, 23–38.

Annino, J. S. and Russell, E. C. (1979). The Ten Most Frequent Causes of Simulation Analysis Failure, CACI, Los Angles, CA, Report 7.

Anonymous et al. (1985). A Measure of Transaction Processing Power, Datamation, 31(7),112–118.

Artis, H. P. (1978). Capacity Planning for MVS Computer Systems, in D. Ferrari, Ed., Performance of Computer Installations, North-Holland, Amsterdam, 25–35.

Bahr, D. (1975). A Note on Figures of Merit, Performance Evaluation Review, 4(3), 1–3.

Bard, Y. (1979). Some Extensions to Multiclass Queueing Network Analysis, in Arato, M., Butrimenko, A., and Gelenbe, E., Eds., Performance of Computer Systems, North-Holland, Amsterdam.

Barnes, M. F (1979). Measurement and Modelling Methods for Computer System Performance, Input Two-Nine, Surrey, U.K.

Baskett, F., Chandy, K. M., Muntz, R. R. and Palacios, F G. (1975). Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM, 22(2), 248–260.

Bentley, J. L. (1982). Writing Efficient Programs, Prentice-Hall, Englewood Cliffs, NJ.

Birtwistle, G., Dahl, O.-J., Myhrhaug, B. and Nygaard, K. (1973). SIMULA Begin, Auerbach, Philadelphia, PA.

Blum, L., Blum, M. and Shub, M. (1986). A Simple Pseudo-Random Number Generator, SIAM Journal on Computing, 15(2), 364–383.

Bobillier, P. A., Kahan, B. C. and Probst, A. R. (1976). Simulation with GPSS and GPSS V, Prentice-Hall, Englewood-Cliffs, NJ.

Bouhana, J. P. (1979). Using Accounting Log Data in Performance Reporting, Proc. CPEUG’79, San Diego, CA, 241–243.

Box, G. E. P. and Muller, M. E. (1958). A Note on the Generation of Random Normal Deviates, Annals of Mathematical Statistics, 29, 610–611.

Box, G. E. P., Hunter, W. G. and Hunter, J. S. (1978). Statistics for Experimenters, Wiley, New York.

Bratley, P., Fox, B. L. and Schrage, L. E. (1986). A Guide to Simulation, Springer-Verlag, New York.

Bright, H. S. and Enison, R. L. (1979). Quasi-Random Number Sequences from a Long-Period TLP Generator with Remarks on Application to Cryptography, ACM Computing Surveys, 11, 357–370.

Brown, R. (1988). Calendar Queues: A Fast O(1) Priority Queue Implementation for the Simulation Event Set Problem, Communications of the ACM, 31(10), 1220–1227.

Browne, J. C., Chandy, K. M., Brown, R. M., Keller, T. W., Towsley, D. F and Dizzly, C. W. (1975). Hierarchical Techniques for the Development of Realistic Models of Complex Computer Systems, Proceedings of IEEE, 62(6), 966–975.

Buchholz, W. (1969). A Synthetic Job for Measuring System Performance, IBM Systems Journal, 8(4), 309–318.

Bulgren, W. G. (1982). Discrete System Simulation, Prentice-Hall, Englewood Cliffs, NJ.

Buzen, J. P. (1973). Computational Algorithms for Closed Queueing Networks with Exponential Servers, Communications of the ACM, 16(9), 527–531.

Buzen, J. P. (1976). Fundamental Laws of Computer System Performance, Proc. SIGMETRICS’76, Cambridge, MA, 200–210.

CACI (1983). SIMSCRIPT II.5 Programming Language, CACI, Los Angeles, CA.

COMTEN, Inc. (1977). DYNAPROBE D-7900 User’s Guide, COMTEN, Inc., St. Paul, MN.

Calcagni, J. M. (1976). Shape in Ranking Kiviat Graphs, Performance Evaluation Review, 5(1), 35–37.

Calzarossa, M. and Ferrari, D. (1986). A Sensitivity Study of the Clustering Approach to Workload Modeling, Performance Evaluation, 6, 25–33.

Chambers, J. M., Cleveland, W. S., Kleiner, B. and Tukey, P. A. (1983). Graphical Methods for Data Analysis, Wadsworth International Group, Belmont, CA and Duxbury Press, North Scituate, MA.

Chandy, K. M., Herzog, U. and Woo, L. (1975). Parametric Analysis of Queueing Networks, IBM Journal of Research and Development, 19(1), 36–42.

Chandy, K. M. and Neuse, D. (1982). Linearizer: A Heuristic Algorithm for Queueing Network Models of Computing Systems, Communications of the ACM, 25(2), 126–134.

Conveyou, R. R. and McPherson, R. D. (1967). Fourier Analysis of Uniform Random Number Generators, Journal of the ACM, 14, 100–119.

Cooper, R. (1981). Introduction to Queueing Theory, North-Holland, New York.

Crane, M. A. and Lemoine, A. J. (1977). An Introduction to the Regenerative Method for Simulation Analysis, Springer-Verlag, New York.

Curnow, H. J. and Wichmann, B. A. (1975). A Synthetic Benchmark, The Computer Journal, 19(1), 43–49.

Dahl, O.-J., Myhrhaug, B. and Nygaard, K. (1982). SIMULA 67. Common Base Language, Norwegian Computing Center, Oslo, Norway.

Das, M. N. and Gire, N. C. (1986). Design and Analysis of Experiments, Wiley, New York.

Datametrics Systems Corp. (1983). Capacity Planning: A State of the Art Survey, National Bureau of Standards, Washington, DC, Report No. NBS-GCR-83-440.

Denning, P. J. and Buzen, J. R. (1978). The Operational Analysis of Queueing Network Models, Computing Surveys, 10(3), 225–261.

Dongarra, J. J. (1983). Performance of Various Computers Using Standard Linear Equations Software in a FORTRAN Environment, Computer Architecture News, 11(5). Recent updates to this article can be obtained from the author.

Dunn, O. J. and Clark, V. A. (1974). Applied Statistics, Analysis of Variance and Regression, Wiley, New York.

Edgeman, R. L. (1989). Random Number Generators and the Minimal Standard, Communications of the ACM, 32(8), 1020–1021.

Everitt, B. (1974). Cluster Analysis, Heinemann Educational Books, London.

Ferrari, D. (1972). Workload Characterization and Selection in Computer Performance Measurement, Computer, 5(7),18–24.

Ferrari, D. (1978). Computer Systems Performance Evaluation, Prentice-Hall, Englewood Cliffs, NJ.

Ferrari, D., Serazzi, G. and Zeigner, A. (1983). Measurement and Tuning of Computer Systems, Prentice-Hall, Englewood Cliffs, NJ.

Finehirsh, S. (1985). Effective Service Level Reporting, Proc. CMG’85, Dallas, TX, 505–509.

Fishman, G. S. and Moore, L. R. (1986). An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus 231 – 1, SIAM Journal on Scientific and Statistical Computing, 7, 24–45.

Fleming, P. J. and Wallace, J. J. (1986). How Not to Lie with Statistics: The Correct Way To Summarize Benchmark Results, Communications of the ACM, 29(3), 218–221.

Fox, B. L. (1963). Generation of Random Samples from the Beta and F distributions, Technometrics, 5, 269–270.

Franta, W. R. (1977). The Process View of Simulation, North-Holland, New York.

Franta, W. R. and Maly, K. (1977). An Efficient Data Structure for the Simulation Event Set, Communications of the ACM, 20(8), 596–602.

Frieze, A. M., Kannan, R., and Lagarias, J. C. (1984). Linear Congruential Generators Do Not Produce Random Sequences, Proc. 25th Symp. on Foundations of Computer Sci., Boca Raton, FL, 480–484.

Fushimi, M. and Tezuka, S. (1983). The k-Distribution of Generalized Feedback Shift Register Pseudorandom Numbers, Communications of the ACM, 26(7), 516–523.

Fushimi, M. (1988). Designing a Uniform Random Number Generator Whose Subsequences are k-Distributed, SLAM Journal on Computing, 17(1), 89–99.

Gelenbe, E. and Mitrani, I. (1980). Analysis and Synthesis of Computer Systems, Academic Press, London.

Gelenbe, E. and Pujolle, G. (1987). Introduction to Queueing Networks, Wiley, New York.

Gibson, J. C. (1970). The Gibson Mix, IBM Systems Development Division, Poughkeepsie, NY, Report No. TR 00.2043.

Gilbreath, J. (1981). A High-Level Language Benchmark, Byte, 6(9), 180–198.

Glasser, N. E. (1987). The Remote Channel System, M. S. Thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, MA.

Goldstein, S. (1988). Storage Benchmarking—Traps, Pitfalls, and Swindles, Proc. CMG’88, Dallas, TX, 1058–1063.

Golomb, S. W. (1982). Shift Register Sequences, Aegean Park Press, Laguna Hills, CA.

Gordon, W. J. and Newell, G. E (1967). Closed Queueing Systems with Exponential Servers, Operations Research, 15(2), 254–265.

Greenberger, M. (1961). An A Priori Determination of Serial Correlation in Computer Generated Random Numbers, Mathematics of Computation, 15, 383–389.

Gross, D. and Harris, C. (1985). Fundamentals of Queueing Theory, Wiley, New York.

Gross, T., Hennessy, J., Przybylski, S. and Rowen, C. (1988). Measurement and Evaluation of the MIPS Architecture and Processor, ACM Transaction on Computer Systems, 6(3), 229–257.

Haack, D. G. (1981). Statistical Literacy. A Guide to Interpretation, Duxbury Press, North Scituate, MA.

Hansen, P., Linton, M., Mayo, R., Murphy, M. and Patterson, D. A. (1982). A Performance Evaluation of the Intel iAPX432, Computer Architecture News, 10(4), 17–26.

Harman, H. H. (1976). Modern Factor Analysis, University of Chicago Press, Chicago, IL.

Hastings, C. Jr., (1955). Approximations for Digital Computers, Princeton University Press, Princeton, NJ.

Hastings, N. A. J. and Peacock, J. B. (1975). Statistical Distributions, Wiley, New York.

Hicks, C. R. (1973). Fundamental Concepts in the Design of Experiments, Holt, Rinehart, & Winston, New York.

Holmes, N. (1984). Designer’s Guide to Creating Charts & Diagrams, Watson-Guptill Publications, New York.

Hooke, R. (1983). How to Tell the Liars From the Statisticians, Marcel Dekker, New York.

Houghton, R. C. Jr., (1982). Program Instrumentation Techniques, Proc. CPEUG’82, Washington, DC, 195–202.

Howard, P C., Ed., (1983). The EDP Performance Management Handbook, Vol. 2: Tools and Techniques, Applied Computer Research, Phoenix, AZ.

Huff, D. (1954). How to Lie with Statistics, Norton, New York.

Hughes, J. H. (1980). Diamond—A Digital Analyzer and Monitoring Device, Proc. Performance’80, Toronto, Canada, published as Performance Evaluation Review, 9(2), 27–34.

IBM (1968). System/360 Scientific Subroutine Package, Version III, Programmer’s Manual, IBM, White Plains, NY, p. 77.

IBM (1972). SIMPL/I Program Reference Manual, Publication SH19-5060-0, IBM, New York.

IMSL (1987). IMSL Stat/Library User’s Manual, International Mathematical and Statistical Libraries, Houston, TX, 947–951.

Jackson, J. R. (1963). Jobshop-Like Queueing Systems, Management Science, 10(1), 131–142.

Jain, R. and Turner, R. (1982). Workload Characterization Using Image Accounting, Proc. CPEUG’82, Washington, DC, 111–120.

Jain, R., Chiu, D. M. and Hawe, W. (1984). A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Systems, Digital Equipment Corporation, Littleton, MA, Technical Report DEC-TR-301.

Jain, R. (1985). Using Simulation to Design a Computer Network Congestion Control Protocol, Proc. Sixteenth Annual Pittsburgh Conf. on Modeling and Simulation, Pittsburgh, PA, 987–993.

Jain, R. and Chlamtac, I. (1985). The P2 Algorithm for Dynamic Calculation of Quantiles and Histograms without Storing Observations, Communications of the ACM, 28(10),1076–1085.

Jain, R. (1986). A Timeout-based Congestion Control Scheme for Window Flow-controlled Networks, IEEE Journal on Selected Areas in Communications, SAC-4(7), 1162-1167.

Jain, R. and Routhier, S. (1986). Packet Trains: Measurements and a New Model for Computer Network Traffic, IEEE Journal on Selected Areas in Communications, SAC-4(6), 986–995.

Jöhnk, M. D. (1964). Erzeugung von Betaverteilten und Gammaverteilten Zufallszahlen, Metrika, 8, 5–15.

Joyce, J., Lomow, G., Slind, K. and Unger, B. (1987). Monitoring Distributed Systems, ACM Transactions on Computer Systems, 5(2), 121–150.

Katzan, H. Jr., (1971). APL User’s Guide, Van Nostrand Reinhold, New York.

Kelly-Bootle, S. (1981). The Devil’s DP Dictionary, McGraw-Hill, New York.

King, R. S. and Julstrom, B. (1982). Applied Statistics Using the Computer, Mayfield Publishing, Palo Alto, CA.

Klahr, R. and Fought, W. S. (1980). Knowledge-based Simulation, Proc. First Conf. AAAI, Stanford, CA, 181–183.

Kleinrock, L. (1975). Queueing Systems, Vol. 1, Theory, Wiley, New York.

Knuth, D. E. (1981). The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, Addison-Wesley, Reading, MA.

Kobayashi, H. (1978). Modelling and Analysis: An Introduction to System Performance Analysis, Addison-Wesley, Reading, MA.

Kolence, K. W. (1973). The Software Empiricist, Performance Evaluation Review, 2(2), 31–36.

Kolence, K. W. and Kiviat, P. J. (1973). Software Unit Profiles and Kiviat Figures, Performance Evaluation Review, 2(3), 2–12.

Koopman, B. O. (1956). Fallacies in Operations Research, Operations Research, 4(4), 422–426.

Kreutzer, W. (1986). System Simulation Programming Styles and Languages, Addison-Wesley, Reading, MA.

L’Ecuyer, P. (1988). Efficient and Portable Combined Random Number Generators, Communications of the ACM, 31(6), 742–774.

Lamie, E. L. (1987). Pascal Programming, Wiley, New York, 150.

Lavenberg, S. S., Ed. (1983). Computer Performance Modeling Handbook, Academic Press, New York.

Law, A. M. and Kelton, W. D. (1982). Simulation Modeling and Analysis, McGraw-Hill, New York.

Law, A. M. (1983). Statistical Analysis of Simulation Output, Operations Research, 19(6), 983–1029.

Lazowska, E. D., Zahorjan, J., Graham, S. G. and Sevcik, K. C. (1984). Quantitative System Performance: Computer System Analysis Using Queueing Network Models, Prentice-Hall, Englewood Cliffs, NJ.

Leavitt, D. (1986a). Modeling and Simulation: Keys to Capacity Planning, Software News, 6(1), 55–57.

Leavitt, D. (1986b). Software Monitors Help Pinpoint Resource Usage, Software News, 6(11), 42–46.

Lefferts, R. (1981). How to Prepare Charts and Graphs for Effective Reports, Barnes and Noble, New York.

Lehmer, D. H. (1951). Mathematical Methods in Large-Scale Computing Units, Harvard University Computation Laboratory Annals, 26, 141–146.

Leung, C. H. C. (1987). Quantitative Analysis of Computer Systems, Wiley, Chichester, U.K.

Levin, R. I. (1981). Statistics for Management, Prentice-Hall, Englewood Cliffs, NJ.

Levy, H. and Clark, D. (1982). On the Use of Benchmarks for Measuring System Performance, Computer Architecture News, 10(6), 5–8.

Lewis, P. A., Goodman, A. S. and Miller, J. M. (1969). A Pseudo-Random Number Generator for the System/360, IBM Systems Journal, 8(2), 136–146,

Lewis, T. G. and Payne, W. H. (1973). Generalized Feedback Shift Register Pseudo-Random Number Algorithm, Journal of ACM, 20(3), 456–468.

Little, J. D. C. (1961). A Proof for the Queueing Formula: L = λW, Operations Research, 9(3), 383–387.

Lucas, H. C. Jr., (1971). Performance Evaluation and Monitoring, Computing Surveys, 3(3), 79–91.

McCormack, W. M. and Sargent, R. G. (1979). Comparison of Future Event Set Algorithms for Simulations of Closed Queueing Systems, in Adam, N. R. and Dogramaci, A., Eds., Current Issues in Computer Simulation, Academic Press, New York, 71–82.

McGalliard, J. and Thareja, A. (1988). Remote Workstation Emulation and Other Alternatives to RTE, Proc. CMG’88, Dallas, TX, 401–406.

McHugh, E. F and Tzelnic, P. (1981). Using Fractional Factorial Design to Examine Scheduling Policies, Proc. CMG’81, New Orleans, LA, 130–135.

McKerrow, P. (1987). Performance Measurement of Computer Systems, Addison-Wesley, Reading, MA.

MacKinnon, D. R. (1987). Is a Picture Always Worth a Thousand Words? Proc. CMG’87, Orlando, FL, 272–278.

McMahon, F. H. (1986). Livermore FORTRAN Kernels. A Computer Test of the Numerical Performance Range, Lawrence Livermore National Laboratories, Livermore, CA.

Majone, G. and Quade, E. S. (1980). Pitfalls of Analysis, Wiley, Chichester, U.K.

Mamrak, S. A. and Amer, P. D. (1977). A Feature Selection Tool for Workload Characterization, Proc. SIGMETRICS’77, Washington, DC, 113–120.

Markowitz, H. M., Hausner, B. and Karr, H. W. (1963). SIMSCRIPT: A Simulation Programming Language, Prentice-Hall, Englewood Cliffs, NJ.

Marsaglia, G. and Bray, T. A. (1964). A Convenient Method for Generating Normal Variables, SIAM Review, 6, 260–264.

Marsaglia, G. (1968). Random Numbers Fall Mainly in the Planes, Proceedings of the National Academy of Science, 60(5), 25–28.

Marsaglia, G. (1983). Random Number Generation, in Ralston, A. and Reilly, E. D. Jr., Eds., Encyclopedia of Computer Science and Engineering, Van Nostrand Reinhold, New York, 1260–1264.

Mason, R. L., Gunst, R. F. and Hess, J. L. (1989). Statistical Design and Analsis of Experiment, Wiley, New York.

Merrill, H. W. B. (1974). A Technique for Comparative Analysis of Kiviat Graphs, Performance Evaluation Review, 3(1), 34–39.

Merrill, H. W. B. (1975). Further Comments on Comparative Evaluation of Kiviat Graphs, Performance Evaluation Review, 4(1), 1–10.

Misra, J. (1986). Distributed Discrete-Event Simulation, ACM Computing Surveys, 18(1), 39–66.

Mitrani, I. (1982). Simulation Techniques for Discrete-Event Systems, Cambridge University Press, London.

Molloy, M. K. (1989). Fundamentals of Performance Modeling, Macmillan, New York.

Montgomery, D. C. (1984). Design and Analysis of Experiments, Wiley, New York.

Morris, M. F. (1974). Kiviat Graphs—Conventions and Figure of Merit, Performance Evaluation Review, 3(3), 2–8.

Morris, M. F. and Roth, R. F. (1982). Tools and Techniques: Computer Performance Evaluation for Effective Analysis, Van Nostrand Reinhold, New York.

Natrella, M. G. (1966). Experimental Statistics, National Bureau of Standards, Washington, DC, Handbook 91.

Nutt, G. J. (1975). Tutorial: Computer System Monitors, Computer, 8(11), 51–61.

Nutt, G. J. (1979). A Survey of Remote Monitoring, National Bureau of Standards, Washington, DC, Special Publication 500–42.

O’Donovan, T. M. (1980). GPSS Simulation Made Simple, Wiley, Chichester, U.K.

Oed, W. and Mertens, B. (1981). Characterization of Computer Systems Workload, Computer Performance, 2(2), 77–83.

Papoulis, A. (1965). Probability, Random Variables, and Stochastic Processes, McGraw–Hill, New York.

Park, S. K. and Miller, K. W. (1988). Random Number Generators: Good Ones Are Hard to Find, Communications of the ACM, 31(10), 1192–1201.

Pasupathy, S. (1989). Glories of Gaussianity, IEEE Communications Magazine, 27(8), 37–38.

Patterson, D. A. (1982). A Performance Evaluation of the Intel 80286, Computer Architecture News, 10(5), 16–18.

Patterson, D. A. and Sequin, C. H. (1982). A VLSI RISC, Computer, 15(9), 8–21.

Pinkerton, T. B. (1977). Techniques for Software Monitoring, in System Tuning, InfoTech International, Maidenhead, U.K., 347–358.

Plattner, B. and Nievergelt, J. (1981). Monitoring Program Execution: A Survey, Computer, 14(11), 76–93.

Powell, C. (1988). A Passion for Graphics Excellence, Proc. CMG’88, Dallas, TX, 761–765.

Power, L. R. (1983). Design and Use of a Program Execution Analyzer, IBM Systems Journal, 22(3), 271–294.

Prime Computer (1984). Subroutines Reference Guide, 3rd ed., Prime Computer, Framingham, MA, p. 12.45.

Pritsker, A. and Young, R. E. (1975). Simulation with GASP-PL/I: A PL/I Based Continuous/Discrete Simulation Language, Wiley-Interscience, New York.

Proppe, M. and Wallack, B. (1982). The Design and Application of a Remote Terminal Emulator, Proc. CPEUG’82, Washington, DC, 409–413.

Ramage, I. L. (1977). The Design of Software Monitors, in System Tuning, InfoTech International, Maidenhead, U.K., 359–372.

Ramana-Reddy, Y. V., Fox, M. S., Husain, N. and McRoberts, M. (1986). The Knowledge-Based Simulation System, IEEE Software, 3(2), 26–37.

Reeves, C. M. (1984). Complexity Analyses of Event Set Algorithms, The Computer Journal, 27(1), 72–79.

Reichmann, W. J. (1961). Use and Abuse of Statistics, Oxford University Press, New York.

Reiser, M. and Lavenberg, S. S. (1980). Mean-Value Analysis of Closed Multichain Queueing Networks, Journal of the ACM, 27(2), 313–322.

Ross, P. J. (1988). Taguchi Techniques for Quality Engineering, McGraw-Hill, New York.

Rubinstein, R. Y. (1986). Monte Carlo Optimization, Simulation and Sensitivity of Queueing Networks, Wiley, New York.

Runyon, R. P. (1977). Winning with Statistics: A Painless First Look at Numbers, Ratios, Percentages, Means, and Inference, Addison-Wesley, Reading, MA.

Santha, M. and Vazirani, U. V. (1984). Generating Quasi-Random Sequences from Slightly Random Sources, Proc. 25th Symp. on Foundations of Computer Science, Boca Raton, FL, 434–440.

Sauer, C. H. and Chandy, K. M. (1981). Computer Systems Performance Modelling, Prentice-Hall, Englewood Cliffs, NJ.

Scherr, A. (1967). An Analysis of Timeshared Computer Systems, MIT Press, Cambridge, MA.

Schmid, C. E and Schmid, S. E. (1979). Handbook of Gmphic Presentation, Wiley, New York.

Schmid, C. E (1983). Statistical Graphics, Wiley, New York.

Schrage, L. E. (1979). A More Portable FORTRAN Random Number Generator, ACM Transactions on Mathematical Software, 5(2), 132–138.

Schweitzer, P. (1979). Approximate Analysis of Multiclass Closed Networks of Queues, International Conf. on Stochastic Control and Optimization, Amsterdam.

Serazzi, G. (1981). A Functional and Resource-Oriented Procedure for Workload Modeling, Proc. Performance’81, Amsterdam, North-Holland, Amsterdam, 345–361.

Serazzi, G. (1985). Workload Modeling Techniques, in Abu El Ata, N., Ed., Modelling Techniques and Tools for Performance, Analysis, North-Holland, Amsterdam, 13–27.

Sherman, S. W. and Browne, J. C. (1973). Trace-Driven Modeling: Review and Overview, Proc. Symp. on Simulation of Computer Systems, 201–207.

Smith, J. E. (1988). Characterizing Computer Performance with a Single Number, Communications of the ACM, 31(10), 1202-1206.

SPEC (1990). SPEC Benchmark Suite Release 1.0, SPEC Newsletter 2(2), 3–4. Available from Waterside Associates, Fremont, CA.

Spiegel, M. G. (1980). RTE’s- Past is Prologue, Proc. CPEUG’80, Orlando, FL, 303–310.

Sreenivasan, K. and Kleinman, A. J. (1974). On the Construction of a Representative Workload, Communications of the ACM, 17(3), 127–133.

Stevens, B. A. (1975). A Note on Figure of Merit, Performance Evaluation Review, 4(1), 11–19.

Strauss, M. J. (1981). Computer Capacity: A Production Control Approach, Van Nostrand Reinhold, New York.

Suri, R. (1983). Robustness of Queueing Network Formulas, Journal of the ACM, 30(3), 564–594.

Svobodova, L. (1976). Computer Performance Measurement and Evaluation Methods: Analysis and Applications, Elsevier, New York.

Tanenbaum, A. (1988). Computer Networks, Prentice-Hall, Englewood Cliffs, NJ.

Tausworthe, R. C. (1965). Random Numbers Generated by Linear Recurrence Mod Two, Mathematics of Computation, 19, 201–209.

Tezuka, S. (1987). Walsh-Spectral Test for GFSR Pseudorandom Numbers, Communications of the ACM, 30(8), 731–735.

Tolopka, S. (1981). An Event Trace Monitor for the VAX 11/780, Proc. SIGMETRICS’81, Las Vegas, NV, 121–128.

Tootill, J. P. R., Robinson, W. D. and Adams, A. G. (1971). The Runs Up and Down Performance of Tausworthe Pseudo-Random Number Generators, Journal of the ACM, 18, 381–399.

Transaction Processing Performance Council (TPC) (1989). TPC Benchmark A, Draft 5E (Edited) Proposed Standard. Available from ITOM International Co., Los Altos, CA.

Trehan, V. (1978). Problems in Remote Terminal Emulation, Proc. CPEUG’78, Boston, MA, 37–61.

Trivedi, K. S. (1982). Probability and Statistics with Reliability Queueing and Computer Science Applications, Prentice-Hall, Englewood Cliffs, NJ.

Tsao, R. F and Margolin, B. H. (1971). A Multifactor Paging Experiment: II Statistical Methodology, in Freiberger, W., Ed., Statistical Computer Performance Evaluation, Academic Press, New York, 135–162.

Unger, B. and Fujimoto, R., Eds. (1989). Distributed Simulation, The Society for Computer Simulation, San Diego, CA, 1989.

Vaucher, J. G. and Duval, P. (1975). A Comparison of Simulation Event List Algorithms, Communications of the ACM, 18(4), 223–230.

Vazirani, U. V. and Vazirani, V. V. (1984). Efficient and Secure Pseudo-Random Number Generation, Proc. 25th Symp. on Foundations of Computer Science, Boca Raton, FL, 458–463.

Wagner, D. B. and Lazowska, E. D. (1989). Parallel Simulation of Queueing Networks: Limitations and Potentials, Proc. SIGMETRICS’89, Berkeley, CA, 146–155.

Watkins, S. W. and Abrams, M. D. (1977a). Survey of Remote Terminal Emulators, National Bureau of Standards, Washington, DC, Special Publication 500–4.

Watkins, S. W. and Abrams, M. D. (1977b). Remote Terminal Emulation in the Procurement of Teleprocessing Systems, Proc. NCC’77, Dallas, TX, 723–727.

Webster, W., Ed. (1989). Simulation and AI, Society for Computer Simulations, San Diego, CA, 1989.

White, J. V. (1984). Using Charts and Graphs: 1000 Ideas for Visual Persuasion, Bowker, New York.

Wichmann, B. A. (1976). Ackermann’s Function: A Study in the Efficiency of Calling Procedures, BIT, 16, 103–110.

Wight, A. S. (1981). Cluster Analysis for Characterizing Computer System Work-loads—Panacea or Pandora? Proc. CMG’81, New Orleans, LA, 183–189.

Woolsey, R. E. D. and Swanson, H. S. (1975). Operations Research for Immediate Applications, Harper & Row, New York.

Wright, L. S., Kohler, W. H. and Zahavi, W. Z. (1989). The Digital DebitCredit Benchmark: Methodology and Results, Proc. CMG’89, Reno, NV, 84–92.

Wyman, F. P. (1975). Improved Event Scanning Mechanisms for Discrcte-Event Simulation, Communications of the ACM, 18(6), 350–353.

Zahorjan, J., Sevcik, K. C., Eager, D. L. and Galler, B. (1982). Balanced Job Bound Analysis of Queueing Networks, Communications of the ACM, 25(2), 134–141.


Previous Table of Contents Next

Copyright © John Wiley & Sons, Inc.