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

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

Decision Tree Classification

 A decision tree is a flowchart-like tree structure. The topmost node in a tree is the root node. The each internal node (non-leaf node) denotes a test on an attribute and each branch represents an outcome of the test. The each leaf node (or terminal node) holds a class label. Decision trees can handle multidimensional data.  Some of the decision tree algorithms are Iterative Dichotomiser (ID3), C4.5 (a successor of ID3), Classification and Regression Trees (CART). Most algorithms for decision tree induction  follow a top-down approach.  The tree starts with a training set of tuples and their associated class labels. The algorithm is called with data partition, attribute list, and attribute selection method, where the data partition is the complete set of training tuples and their associated class labels. The splitting criterion is determined by attribute selection method which indicates the splitting attribute that may be splitting point or splitting subset. Attribu...

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.