Logo Data Structures and Algorithms with Object-Oriented Design Patterns in C++
next up previous contents index

A Simplified Model of the Computer

 

The detailed model of the computer given in the previous section is based on a number of different timing parameters-- tex2html_wrap_inline58177, tex2html_wrap_inline58179, tex2html_wrap_inline58189, tex2html_wrap_inline58191, tex2html_wrap_inline58193, tex2html_wrap_inline58195, tex2html_wrap_inline58197, tex2html_wrap_inline58201, tex2html_wrap_inline58203, tex2html_wrap_inline58579, tex2html_wrap_inline58581, and tex2html_wrap_inline58237. While it is true that a model with a large number of parameters is quite flexible and therefore likely to be a good predictor of performance, keeping track of the all of the parameters during the analysis is rather burdensome.

In this section, we present a simplified model which makes the performance analysis easier to do. The cost of using the simplified model is that it is likely to be a less accurate predictor of performance than the detailed model.

Consider the various timing parameters in the detailed model. In a real machine, each of these parameters will be a multiple of the basic clock period  of the machine. The clock frequency  of a modern computers is typically between 100 and 500 MHz. Therefore, the clock period is typically between 2 and 10 ns. Let the clock period of the machine be T. Then each of the timing parameters can be expressed as an integer multiple of the clock period. E.g., tex2html_wrap_inline58613, where tex2html_wrap_inline58615, tex2html_wrap_inline58617.

The simplified model eliminates all of the arbitrary timing parameters in the detailed model. This is done by making the following two simplifying assumptions:

The effect of these two assumptions is that we no longer need to keep track of the various operations separately. To determine the running time of a program, we simply count the total number of cycles taken.




next up previous contents index

Bruno Copyright © 1997 by Bruno R. Preiss, P.Eng. All rights reserved.