Introduction to Computer Performance Analysis With Mathematica

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

''Introduction to Computer Performance Analysis with Mathematica'' is designed as a beginner's guide to computer performance analysis and assumes only a basic knowledge of computers and some mathematical proficiency. The mathematical aspects have been relegated to a Mathematica program disk, allowing readers to try out most of the techniques as they work their way through the book. Ideally suited for this self-tutoring task, the use of Mathematica offers valuable properties such as visualization system for functions and data and a modeling and data analysis environment. However, no prior experience of Mathematica is required and readers should benefit from this book even if they bypass the Mathematica exercises.

Author(s): Arnold O. Allen
Series: Computer Science and Scientific Computing
Edition: Har/Dis
Publisher: Morgan Kaufmann Publishers
Year: 1994

Language: English
Pages: 356

Cover......Page 377
Copyright......Page 381
Warranty and Disclaimer......Page 383
Contents......Page 384
Preface......Page 387
1.1 Introduction......Page 20
1.2 Capacity Planning......Page 25
1.3 Organizations & Journals for Performance Analysts......Page 71
1.4 Review Exercises......Page 72
1.5 Solutions......Page 73
1.6 References......Page 77
2.1 Introduction......Page 83
2.2 Central Processing Units......Page 87
2.3 The Memory Hierarchy......Page 96
2.4 Solutions......Page 115
2.5 References......Page 117
3.1 Introduction......Page 121
3.2 Basic Queueing Network Theory......Page 126
3.3 Queueing Network Laws......Page 131
3.4 Bounds and Bottlenecks......Page 136
3.5 Modeling Study Paradigm......Page 139
3.6 Advantages of Queueing Theory Models......Page 142
3.7 Solutions......Page 143
3.8 References......Page 144
4.1 Introduction......Page 145
4.2 Analytic Queueing Theory Network Models......Page 146
4.3 Solutions......Page 190
4.4 References......Page 200
5.2 Measurement Tools......Page 203
5.3 Model Parameterization......Page 209
5.4 Solutions......Page 218
5.5 References......Page 221
6.1 Introduction......Page 223
6.2 Introduction to Simulation......Page 224
6.3 Writing a Simulator......Page 226
6.4 Simulation Languages......Page 249
6.5 Simulation Summary......Page 250
6.6 Benchmarking......Page 251
6.7 Solutions......Page 271
6.8 References......Page 275
7.2 NFU Time Series Forecasting......Page 279
7.3 Solutions......Page 288
7.4 References......Page 290
8.2 Review of Chapters 1–7......Page 291
8.3 Recommendations......Page 333
8.4 References......Page 339
A.1 Introduction......Page 345
A.2 References......Page 366
B......Page 367
C......Page 368
F......Page 369
I......Page 370
M......Page 371
P......Page 372
R......Page 373
S......Page 374
V......Page 375
Z......Page 376