7. Consider the fragment of RISC-V assembly code belowsdx29, 12(x16)x29, 8(x16)х17, х15, х14Idsubbeqzaddx17, labelх15, х11, х14х15, х30, х14х2, х3, -1subaddi//implements x2 = x3 - 1addX2, х2, х5Suppose we modify the pipeline so that it has only one memory (that handles bothinstructions and data). In this case there will be structural hazard every time a program needsto fetch an instruction during the same cycle in which another instruction access the data.How many stall cycles are introduced in the code due to structural hazards?--Ans:

x29, 12(x16) x29, 8(x16) х17, х15, х14 x17, label х15, х11, х14 ub zba d ub ddi d х15, х30, х14 х2, х3, -1 //implements x2 = x3 - 1 х2, х2, х5 uppose we modify the pipeline so that it has only one memory (that structions and data). In this case there will be structural hazard every time a fetch an instruction during the same cycle in which another instruction acc

x29, 12(x16) x29, 8(x16) х17, х15, х14 x17, label х15, х11, х14 ub zba d ub ddi d х15, х30, х14 х2, х3, -1 //implements x2 = x3 - 1 х2, х2, х5 uppose we modify the pipeline so that it has only one memory (that structions and data). In this case there will be structural hazard every time a fetch an instruction during the same cycle in which another instruction acc

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

Suppose a RISC machine uses overlapping register windows for passing parameters between procedures. The machine has 298 registers. Each register window has 32 registers, of which 10 are global variables and 10 are local variables.Q) By how much would the current window pointer (CWP) be incremented at each procedure call?
Consider a demand-paging system with a paging disk that has an average access and transfer time of 25 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added an associative memory that reduces access time to one memory reference if the page-table entry is in the associative memory. Assume that 75 percent of the accesses are in the associative memory and that, of those remaining, 10 percent (or 2.5 percent of the total) cause page faults. What is the effective memory access time?
Suppose a RISC machine uses overlapping register windows for passing parameters between procedures. The machine has 298 registers. Each register window has 32 registers, of which 10 are global variables and 10 are local variables.Q) How many register windows would be available for use?
Suppose a RISC machine uses overlapping register windows for passing parameters between procedures. The machine has 298 registers. Each register window has 32 registers, of which 10 are global variables and 10 are local variables.Q) How many registers would be available for use by output parameters?
Consider a 32-bit computer with the MIPS assembly set, that executes the following code fragment loaded in memory in the address 0x0000000. li $t0, 1000 li $t1, 0 li $t2, 0 loop: addi $t1, $t1, 1 addi $t2, $t2, 4 beq $t1, $t0, loop This computer has a 4-way associative cache memory of 32 KB and lines of 16 bytes. Calculate the number of cache miss of the previous code, and the hit ratio, assuming that no other program is executing and that the cache memory is initially empty.
Computer Science 1 .Consider the task of doubling all the elements of a 8192 element vector, which might be done on a SISD machine by the following code. Suppose each iteration of the loop requires 20 clock cycles - so the whole process needs 163,840 clocks. for (int i = 0; i < 8192; i ++) x[i] *= 2.0; Now suppose, instead, that the process is done on a pipelined processor having a single pipeline that supports memory to memory vector operations. Assume that each computation (fetch x[i], double it, store result) still takes 20 clock cycles, but that the pipeline, once full, can produce one result each cycle. How many clock cycles total will be needed for this case?
Consider the following C functions and assembly codeAssume that long is 64 bits, int is 32 bits, short is 16 bits, and therepresentation is two’s complement.Assembly Code: imulq %rsi, %rdiimulq %rdx, %rsiaddq %rsi, %rdileaq (%rdi,%rdi,2), %raxsalq $3, %raxret long functionA(long a, long b, long c){long d = a*b;long e = b*c;return 18 * (d+e);} long functionB(long a, long b, long c){long d = a*b;long e = b*c;return 24 * (d*e);} long functionC(long a, long b, long c){long d = a*b;long e = b*c;return 24 * (d+e);} long functionD(long a, long b, long c){long d = a*b;long e = b*c;return 32 * (d*e);} Which of the functions compiled into the assembly code shown?
An 8-bit computer has a registers R0-R7. The content of register R3 is 20H and R4 is 40H.The location 20H,40H and 43H contains 2’s complement equivalent(8-bit) of (-29),(-25) and (-19) respectively. Consider following code: MOV R1,(R3) :Move immediate ADD R1,03H(R4) :ADD ASR R1 :Arithmetic shift right by 1-bit XRI R1,01H :XOR immediate Illustrate how alteration in register content R1 occurs as above set of instructions are executed. Determine the status of Carry and sign flag after execution of ADD and XOR instructions. After execution of last instruction (XRI) take 2’s complement equivalent of Register R1 and consider as Dividend X. Then compute (X/5) using Non-Restoring division method. . Demonstrate clearly the complete step by step procedure to compute the results.
Q6. Draw directed acyclic graph (DAG) for the given three-address code 1. T1 = a + b 2. T2 = a * 2 3. a = b [T1] 4. c = T1 + T2 5. T3 = c – 25 6. If c < a GOTO (3) 7. d = a + b 8. T6 = d – T1 9. T7 = k * 3 10.if T7 > 15 GOTO (1)
In this exercise, we consider the execution of a loop in a statically scheduled superscalar processor that has full forwarding. Loop: lw $t3, 0($s1) lw $t4, 0($s2) mul $t1, $t3, $t4 add $s0, $t1, $s0 addi $s1, $s1, -8 addi $s2, $s2, -8 bne $s1, $zero, Loop Unroll this loop so that three iterations of it are done at once and schedule it for a 2-issue pipelined processor. This processor can issue one ALU/branch instruction and one lw/sw instruction each cycle. Assume that the loop always executes a number of iterations that is a multiple of 3. You can use any unused registers when changing the code to eliminate dependencies.
Implement the following functions in MIPS assembly language, MARS 4,5 simulator Implement Sin (X), Cos (X) and e^X through direct computation using Taylor series expansion
Consider the image attached that represents part of the memory of a 16-bit address space that has an addressability of 2 bytes. In the von Neumann model, the contents of a memory location can also be interpreted as an instruction. E.) Interpret the contents at address 0x0C0E as an LC-3 instruction to determine the operation. (Enter either ADD, JMP, LDR, or OTHER if it is not one of the first 3) F.) Interpret the contents at address 0x0C0F as an LC-3 instruction to determine the operation. (Enter either ADD, JMP, LDR, or OTHER if it is not one of the first 3) A memory location can store an address. We call that memory location's contents a "pointer" since it's an address that "points" to another memory location. G.) Interpret the contents at address 0x0C0B as a pointer. (Enter hex like the following example: 0x2A3F) H.) What are the contents of the memory location that the pointer above is pointing to? (Enter hex like the following example: 0x2A3F) Another reference : LC-3…