Consider the following high level code. Ignoring the ellipses, convert this code into a minimal MIPS...

   

Transcribed Image Text:

Consider the following high level code. Ignoring the ellipses, convert this code into a minimal MIPS code. Indicate the total number of instructions required to execute the program. Also, if the program is run on a five pipe stage MIPS implementation (i.e. Question 2 Datapath) with a clock cycle time of 200 ps, what will be the execution time of the program? int main(){ int i,y, fib[10]; int no = 0; int n1 = 1; for(i=0;i <10;i++) { if(i <2){ fib[i]=i; } else{ fib[i]=n0+n1; n0=nl; nl = fib[i]; } y doubleFib(fib[i]); } int doubleFib(int x){ return 2*x; } Consider the following high level code. Ignoring the ellipses, convert this code into a minimal MIPS code. Indicate the total number of instructions required to execute the program. Also, if the program is run on a five pipe stage MIPS implementation (i.e. Question 2 Datapath) with a clock cycle time of 200 ps, what will be the execution time of the program? int main(){ int i,y, fib[10]; int no = 0; int n1 = 1; for(i=0;i <10;i++) { if(i <2){ fib[i]=i; } else{ fib[i]=n0+n1; n0=nl; nl = fib[i]; } y doubleFib(fib[i]); } int doubleFib(int x){ return 2*x; }