edited by
165 views
1 votes
1 votes
We have a RISC processor with register-register arithmetic instructions that have the format $R_1\leftarrow R_2\; op\; R_3.$ The pipeline of these instructions runs with a $3$ GHz clock with the following stages: Instruction fetch $= 1$ clock, instruction decode $= 2$ clocks, fetch operands $= 1$ clock, execute $= 3$ clocks and store results $= 2$ clocks. What rate(in MIPS) can we execute register-register instructions that have no data dependencies with other instructions?
edited by

1 Answer

Best answer
1 votes
1 votes
Given:
        $\begin{array}{|c c c c c|}
            \hline
            \textbf{IF} & \textbf{ID} & \textbf{FO} & \textbf{EX} & \textbf{Store} \\
            \hline
            1 & 2 & 1 & 3 & 2 \\
            \hline
        \end{array}$

    $1$ clock cycle $\rightarrow \dfrac{1}{3\times 10^9}$ seconds
    
    $\max (IF,ID,FO,EX,Store) = 3$ clock cycles
    
    $\dfrac{3}{3\times 10^9}$ seconds $\rightarrow 1$ instruction
    
    $1 \text{ second}\rightarrow   10^9$ Instructions
    
    So, rate in MIPS is $1000$ MIPS.
selected by
Answer:

Related questions

1 votes
1 votes
1 answer
3
gatecse asked Aug 30, 2020
152 views
Consider the following array of elements being sorted by merge sort. The sum of all the elements to which $13$ gets compared is _____$$14\; 13\; 24\; 56\; 87\; 98\; 4\; 6...
1 votes
1 votes
2 answers
4
gatecse asked Aug 30, 2020
74 views
If a simple graph $G,$ has $10$ vertices and $11$ edges, the number of edges in the complement of $G$ will be _______