Skip to main content

Exercise 9 - Pipeline Processor

In 1998, Simplex company came up with a simple processor with a clock rate of 4.5 GHz and average CPI of 6. Later, they decided to upgrade the system by replacing simple processor with 5 stage pipelined processor. Due to internal pipeline delay, the processor clock is reduced to 2.5 GHz. Assume that the new system does not implement any techniques to avoid hazards. Find out the following.

a) Clock time in non pipeline processor

b) Execution time of non pipeline processor

c) Clock time in pipeline processor

d) Execution time of pipeline processor for 100 tasks

e) Speedup achieved in pipeline processor

Answer:

a) Clock time in non pipeline processor

Frequency of the clock = 4.5 GHz

Cycle time = 1 / frequency

           = 1 / 4.5 GHz = 1 / 4.5 X 109 Hz

           = 0.222 ns

b) Execution time of non pipeline processor

Non pipeline execution time to process one instruction 

   = No of clock cycles taken to execute one instruction

   = 6 clock cycles

   = 6 X 0.222 ns

   = 1.333 ns

c) Clock time in pipeline processor

Frequency of the clock = 2.5 GHz

Cycle time = 1 / frequency

           = 1 / 2.5 GHz

           = 1 / 2.5 X 109 Hz

           = 0.4 ns

d) Execution time of pipeline processor for 100 tasks

Ideally, one instruction is executed per clock cycle as there are no stalls in the pipeline. So,

Pipeline execution time = 1 clock cycle

                        = 0.4 ns

For 100 tasks           = 100 X 0.4 = 40 ns

e) Speedup achieved in pipeline processor

Speed up = execution time by non pipeline / execution time by pipeline

         = 1.333 / 0.4

         = 3.33 ns

Popular posts from this blog

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. ...

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

Minor, Cofactor, Determinant, Adjoint & Inverse of a Matrix

Consider a matrix Minor of a Matrix I n the above matrix A, the minor of first element a 11  shall be Cofactor The Cofactor C ij  of an element a ij shall be When the sum of row number and column number is even, then Cofactor shall be positive, and for odd, Cofactor shall be negative. The determinant of an n x n matrix can be defined as the sum of multiplication of the first row element and their respective cofactors. Example, For a 2 x 2 matrix Cofactor C 11 = m 11 = | a 22 | = a 22  = 2 Determinant The determinant of A is  |A| = (3 x 2) - (1 x 1) = 5 Adjoint or Adjucate The Adjoint matrix of A , adjA is the transpose of its cofactor matrix. Inverse Matrix A matrix should be square matrix to have an inverse matrix and also its determinant should not be zero. The multiplication of matrix and its inverse shall be Identity matrix. The square matrix has no inverse is called Singular. Inv A = adjA / |A|           [ adjoint A / determ...