Exercise 4: Self-modifying programs - Full Uniformity li $t0, 9 li $t1, 9 blt $t0, $t1, less la $a0, no la $a0, yes li $v0, 4 1. Can we modify the order of executing the instructions to improve the performance of a pipeline? 2. Using the table below, show how the instruction will flow through the pipeline a 5-state pipeline when we have Non-Uniformity. less: print 1: EX M WB 10 11 12 13 14 15 16 17 18 19

Exercise 4: Self-modifying programs - Full Uniformity li $t0, 9 li $t1, 9 blt $t0, $t1, less la $a0, no la $a0, yes li $v0, 4 1. Can we modify the order of executing the instructions to improve the performance of a pipeline? 2. Using the table below, show how the instruction will flow through the pipeline a 5-state pipeline when we have Non-Uniformity. less: print 1: EX M WB 10 11 12 13 14 15 16 17 18 19

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

he pipeline is a way to improve the performance of the processor by increasing thethroughput. As you learned in the class, the instruction execution is divided to 5stages: IF, ID, EX, WB, and MEM. At each stage the processor can pipeline morethan one instruction so that they execute at the same cycle. Recall that some stagecannot be overlapped. For instance, you cannot issue to memory reads at the samestage.Write a program using your favorite programming language that reads assembly codelike the following:LW $0, $1(20) –load instruction at address $1 + 20 and put the result in register $0.ADD $3, $0, $2 –add the content of register $0 to register $2 and store the outcome inregister $3.Your program must simulate the pipeline by creating an execution schedule. Theprogram must determine the dependencies between the instructions, if any, and stallthe pipeline as necessary. The program must show the execution table including thestalls if any. Finally, the program must also output the number…
What is the minimum number of cycles needed to completely execute n instructions on a CPU with a k stage pipeline? Find a formula.
Implement a new unary instruction in place of N0P0 called ASL2 that does two left shifts on the accumulator. V should remain unchanged, but N and Z should correlate with the new value in the accumulator, and C should be the carry from the second shift. Write a program that tests all the features of the new instruction.
Q1: Consider two computers, P1 and P2, of the same instruction set (ISA). We have a program of 7.5x10° instructions and we want to run this program on P1 and P2. The P1 computer is a 5 GHz machine with CPI of 0.8. The P2 computer is a 6 GHz machine with CPI of 1.2. Which computer is faster?
W rite a MIPS program to continuously generate the following series of integers: 1, 2, 3, 6, 9, 18, 27, 54, 81, and so on. Use standard MIPS programming conventions. Use the jump instruction to generate an infinite loop. Write a subroutine EVEN that returns a 1 if the argument is even, else it returns a 0. You must call this subroutine with jal and return from it with jr. Dont use any .data, .word, .text, or .globl commands or li. No hand written and fast answer with explanation
What the code below does? Consider the following code used to implement a new instruction: foo $t3,$t1,$t2: mask : . word 0xFFFFF83Fstart : la $t0 , masklw $t0 , 0 ( $ t 0 )la $t3 , s h f t rlw $t3 , 0 ( $ t 3 )and $t3 , $t3 , $ t 0andi $t2 , $t2 , 0 x 0 0 1 fsll $t2 , $t2 , 6or $t3 , $t3 , $ t 2la $t5 , s h f t rsw $t3 , 0 ( $ t 5 ) shftr: sll $t3 , $t1 , 0 What does foo does?
19.Consider the following program. How many clock cycles required to execute the program in the pipelined implementation using stalling? (Concern the control hazard only.) * [Program) i rmov $0,%rax i rmov $0,%rcx 13. LOOP: стр %гсх,%гах je EXIT inc %rax jmp LOOP i7. EXIT: hlt i1. i2. 14. i5. 16. 9 10 11 12
In x86-64 assembly, how many registers do we have, and can we use registers like %rsp for anything we like? Group of answer choices A. We get 8664 general-purpose registers. Registers are like variables in assembly where we can store information. We can in theory use them for whatever we want, however we do need to follow conventions in order for our program to operate without errors (%rsp for example keeps track of the stack pointer). B. We get unlimited general-purpose registers. Registers are like variables in assembly where we can store information. We can use them for whatever we want. C. We get 16 general-purpose registers. Registers are like variables in assembly where we can store information. We can in theory use them for whatever we want, however we do need to follow conventions in order for our program to operate without errors (%rsp for example keeps track of the stack pointer).
5. Below is a depiction of a loop in instruction memory address Охо TOP: instruction 1 Ox4 instruction 2 Ox8 instruction 3 OxC instruction 4 Ох10 conditional branch to TOP Assume that the branch target buffer is initially empty, and the prediction bits are set to Strongly Taken (ST). Fill in the blanks On the first pass through the loop we take the branch. The branch target bits are now We suffer stalls. On the second pass through the loop we don't take the branch. The branch target bits are now We suffer stalls. On the third pass through the loop we don't take the branch. The branch target bits are now We suffer stalls. On the fourth pass through the loop we don't take the branch. The branch target bits are now We suffer stalls.
C PROGRAMMING HELP! I tried a threaded reply and bartleby wasn't having it. Soooo: Please create the header file as specified and implement it into my script. Thank you for your help, it is seriously appreciated! The header file deals with the following instruction prompt: Find the roots of the second order nontrivial solution.D2y+a1Dy+a2 = 0 => λ 2+a1 λ +a2 = 0Create a header file for this step. I believe the portion of the script that needs to be turned into a utilized header file is located in the main() function. Thank you so much for your help, pasted is a copy of my script so far: #include <stdio.h>#include <math.h> void compute_coefficients(double lambda1, double lambda2, double *C1, double *C2, double *C_alpha, double *theta);void display_output(double lambda1, double lambda2, double C1, double C2, double C_alpha, double theta); int main(){ int a, b, c; double lambda1, lambda2, C1, C2, C_alpha, theta; printf("Enter a, b, and c where a*D2y + b*Dy + c*y =…
What the code below does? Consider the following code used to implement a new instruction: foo $t3,$t1,$t2: mask : . word 0xFFFFF83Fs t a r t : l a $t0 , masklw $t0 , 0 ( $ t 0 )l a $t3 , s h f t rlw $t3 , 0 ( $ t 3 )and $t3 , $t3 , $ t 0a ndi $t2 , $t2 , 0 x 0 0 1 fs l l $t2 , $t2 , 6o r $t3 , $t3 , $ t 2l a $t5 , s h f t rsw $t3 , 0 ( $ t 5 )s h f t r : s l l $t3 , $t1 , 0 What does foo does?
For our simple 2-stage pipeline, we run a particular benchmark program and find that it has 19% conditional branches. An additional 4% are unconditional branches. What is the maximum number of the conditional branches that could be taken if we want to keep the CPI to 1.10 or less? what is the minimum percentage of branch delay slots that need to be filled with useful instructions in order to keep the CPI to 1.0135? I know other students have posted similar questions and they are answered, but those answers do not seem correct, so please do not copy from them