Skip to main content

Performance measure of a Computer

The speed of a processor is dictated by the pulse frequency produced by the clock, measured in cycles per second, or Hertz (Hz).

The rate of pulses is known as the clock rate, or clock speed

One increment, or pulse, of the clock is referred to as a clock cycle, or a clock tick

The time between pulses is the cycle time.

A 1-GHz processor receives 1 billion pulses per second.

The number of machine instructions executed for a program until it runs to completion or for some defined time interval is known as Instruction count (Ic).

The number of clock cycles required varies for different types of instructions such as load, store, branch etc. for any given processor. The cycle per instruction, 

where

Ii - number of executed instructions of type i

The processor time T needed to execute a given program can be expressed as

The four system attributes affect the performance of processor time

  • Instruction set architecture
  • Compiler technology
  • Processor implementation
  • Cache & memory hierarchy

The rate at which the instructions are executed in the processor is measured as its performance, expressed as millions of instructions per second (MIPS).

where

f - frequency of processor clock.

Popular posts from this blog

Exercise 2 - Amdahl's Law

A programmer has parallelized 99% of a program, but there is no value in increasing the problem size, i.e., the program will always be run with the same problem size regardless of the number of processors or cores used. What is the expected speedup on 20 processors? Solution As per Amdahl's law, the speedup,  N - No of processors = 20 f - % of parallel operation = 99% = 1 / (1 - 0.99) + (0.99 / 20) = 1 / 0.01 + (0.99 / 20) = 16.807 The expected speedup on 20 processors is 16.807

Gaussian Elimination - Row reduction Algorithm

 Gaussian elimination is a method for solving matrix equations of the form, Ax=b.  This method is also known as the row reduction algorithm. Back  Substitution Solving the last equation for the variable and then work backward into the first equation to solve it.  The fundamental idea is to add multiples of one equation to the others in order to eliminate a variable and to continue this process until only one variable is left. Pivot row The row that is used to perform elimination of a variable from other rows is called the pivot row. Example: Solving a linear equation The augmented matrix for the above equation shall be The equation shall be solved using back substitution. The eliminating the first variable (x1) in the first row (Pivot row) by carrying out the row operation. As the second row become zero, the row will be shifted to bottom by carrying out partial pivoting. Now, the second variable (x2)  shall be eliminated by carrying out the row operation again. ...

Decision Tree Scalability Methods

 The scalable decision tree induction methods are RainForest and BOAT. RainForest method maintains an AVC set for each attribute at each node. AVC stands for Attribute Value Classlabel. BOAT , stands for Bootstrapped Optimistic Algorithm for Tree construction, uses a statistical technique known as bootstrapping., by which several smaller subsets are created. The several trees are created using the subsets and finally the full tree is generated using the trees created by smaller subsets. BOAT was found to be two to three times faster than RainForest.