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

Decision Tree - Gini Index

The Gini index is used in CART. The Gini index measures the impurity of the data set, where p i - probability that data in the data set, D belong to class, C i  and pi = |C i,D |/|D| There are 2 v - 2 possible ways to form two partitions of the data set, D based on a binary split on a attribute. Each of the possible binary splits of the attribute is considered. The subset that gives the minimum Gini index is selected as the splitting subset for discrete valued attribute. The degree of Gini index varies between 0 and 1. The value 0 denotes that all elements belong to a certain class or if there exists only one class, and the value 1 denotes that the elements are randomly distributed across various classes. A Gini Index of 0.5 denotes equally distributed elements into some classes. The Gini index is biased toward multivalued attributes and has difficulty when the number of classes is large.

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 1 - Amdahl's Law

A programmer is given the job to write a program on a computer with processor having speedup factor 3.8 on 4 processors. He makes it 95% parallel and goes home dreaming of a big pay raise. Using Amdahl’s law, and assuming the problem size is the same as the serial version, and ignoring communication costs, what is the speedup factor that the programmer will get? Solution Speedup formula as per Amdahl's Law, N - no of processor = 4 f - % of parallel operation = 95% Speedup = 1 / (1 - 0.95) + (0.95/4) = 1 / 0.5 + (0.95/4) Speedup = 3.478 The programmer gets  3.478 as t he speedup factor.