1 votes 1 votes A computer has a pipeline with four stages. Each stage takes the same time to do its work, namely, $1$ nsec. How many instructions per second can this machine execute? CO and Architecture tanenbaum operating-system machine-instruction pipelining descriptive + – admin asked Oct 23, 2019 • retagged Jul 5, 2022 by Lakshman Bhaiya admin 1.7k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply mrinmoyh commented Jan 11, 2020 reply Follow Share Lakshman Patel RJIT what is the answer ?? Is it $10^{9}$ or $\frac{n}{n+3}*10^{9}$ 0 votes 0 votes sachin486 commented Jul 19, 2020 reply Follow Share i think 10^9 is right answer 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Is this correct? Since we want to see how many instructions (n, say) can be executed in 1 second (n+3)*10^(-9) = 1 Thus, n = (10^9) - 3 aiyyar.aarushi answered Dec 10, 2019 aiyyar.aarushi comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes 1 Instn -----> 4nsec so, In 1sec -------> 25 *10^7 Instn tech_beardo answered Mar 26, 2020 tech_beardo comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes total four stages. each stage takes 1 nano second, so four stages take 4 ns. so we can say one instruction takes 4 ns. hence in one second total nos of instructions executed=1/4 ns=1/4*10^-9=(1/4)*10^9=25*10^7 nos. DIBAKAR MAJEE answered Apr 27, 2020 DIBAKAR MAJEE comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Tp= 1ns Throughput=1/Tp instruction per second Throughput= 1/10^-9 =1000 MIPS Raju2021 answered May 30, 2020 Raju2021 comment Share Follow See all 0 reply Please log in or register to add a comment.
