15.01.2013 Views

U. Glaeser

U. Glaeser

U. Glaeser

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Jozo J. Dujmović<br />

San Francisco State University<br />

Daniel Tomasevich<br />

San Francisco State University<br />

Ming Au-Yeung<br />

San Francisco State University<br />

Lizy Kurian John<br />

University of Texas<br />

Eric Rotenberg<br />

North Carolina State University<br />

8.1 Measurement and Modeling of Disk<br />

Subsystem Performance<br />

© 2002 by CRC Press LLC<br />

8<br />

Performance Evaluation<br />

8.1 Measurement and Modeling of Disk<br />

Subsystem Performance<br />

Introduction • Description Errors and Prediction Errors of<br />

Disk Subsystem Models • A Simple Acceleration/Deceleration<br />

Model of Disk Access Time • A Fixed Maximum Velocity<br />

Model of Seek Time • Numerical Computation of the Average<br />

Seek Time • A Simple Model of Cached Disk Access<br />

Time • Disk Access Optimization Model • Disk Service Time<br />

Model • Disk Subsystem Benchmark Workload • MVA<br />

Models and Their Limitations • Experimental Results for<br />

LDMVA Model of a Disk Subsystem with Access<br />

Optimization • Experimental Results for LDMVA Model of a<br />

Disk Subsystem with Caching and Access Optimization •<br />

Predictive Power of Queuing Models • Conclusions<br />

8.2 Performance Evaluation: Techniques, Tools,<br />

and Benchmarks<br />

Introduction • Performance Measurement • Performance<br />

Modeling • Workloads and Benchmarks<br />

8.3 Trace Caching and Trace Processors<br />

Trace Cache and Trace Predictor: Efficient High-Bandwidth<br />

Instruction Fetching • Trace Processor: Efficient<br />

High-Bandwidth Instruction Execution • Summary via<br />

Analogy<br />

Jozo J. Dujmovi ć, Daniel Tomasevich, and Ming Au-Yeung<br />

Introduction<br />

In queuing theory literature, many models describe the dynamic behavior of computer systems. Good sources<br />

of such information (e.g. [5,7]) usually include stochastic models based on birth-death formulas, the convolution<br />

algorithm [2], load independent and load dependent mean value analysis (MVA) models [10], and<br />

BCMP networks [1]. Theoretical queuing models presented in computer literature easily explain phenomena<br />

such as bottlenecks, saturation, resource utilization, etc.; however, it is very difficult to find sources that show<br />

a second level of modeling, which focuses on the ability of models to also achieve good numerical accuracy<br />

when modeling real computer systems running real workloads. Although the phenomenology is important<br />

in the classroom, it is the numerical accuracy that counts in engineering practice. The usual task of performance<br />

analysts is to measure system performance and then derive models that can describe and predict the<br />

behavior of analyzed systems with reasonable accuracy. Those who try to model the dynamic behavior of<br />

real computer systems running real workloads frequently find this to be a difficult task.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!