The next three questions refer to the following system: A certain ISA has a 32-bit word size, uses single word (32-bit) instructions, has 60 opcodes, 32 registers, and 4Gbyte of byte-addressable memory. One group of instructions in this ISA takes the form: OPCODE | DESTINATION REGISTER | SOURCE REG. | Flag | IMMEDIATE VALUE Or OPCODE | DESTINATION REGISTER | SOURCE REG. 1 | Flag | SOURCE REG. 2 A single bit in the instruction ("Flag") is used to differentiate these two addressing modes. Another group of instructions takes the form OPCODE | SOURCE/DESTINATION REGISTERI PC OFFSET Where PC Offset is the 2's complement "distance" from the current PC to the labelled location.

The next three questions refer to the following system: A certain ISA has a 32-bit word size, uses single word (32-bit) instructions, has 60 opcodes, 32 registers, and 4Gbyte of byte-addressable memory. One group of instructions in this ISA takes the form: OPCODE | DESTINATION REGISTER | SOURCE REG. | Flag | IMMEDIATE VALUE Or OPCODE | DESTINATION REGISTER | SOURCE REG. 1 | Flag | SOURCE REG. 2 A single bit in the instruction ("Flag") is used to differentiate these two addressing modes. Another group of instructions takes the form OPCODE | SOURCE/DESTINATION REGISTERI PC OFFSET Where PC Offset is the 2's complement "distance" from the current PC to the labelled location.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 2PE: If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the...

See similar textbooks

Similar questions

Consider the following store instruction: SW R1, 0x000F(R0). Assume that the registers R0 and R1 are initialized with 0x00000001 and 0x53A78BC Frespectively. A section of the MIPS byte addressable data memory is shown. Give the memory word of the following memory locations after the SW operation: (a). 0x00000015. (b). 0x00000014. (c). 0x00000013. (d) 0x00000012.(e). 0x00000011. (f). 0x00000010.
Will upvote! Find the memory address of the next instruction executed by the microprocessor, when operated in the real mode, for the following CS:IP and 80286 register combinations: a. DS=2F2E & DX=9D64 b. CS=9F7A & IP=AB27 c. ES=DE21 & DI=D75F d. SS=FF5C & BP=92B8 e. DS=DC67 & CX=2FE8
How can I compute sum of each of the component latencies for each instruction? Question 1: This is a three-part question about critical path calculation. Consider a simple single-cycle implementation of LEGv8 ISA. The operation times for the major functional components for this machine are as follows: Component Latency ALU 90 ps Add 70 ps ALU Control Unit 30 ps Shifter 20 ps Control Unit/ROM 50 ps Sign/zero extender 20 ps 2-1 MUX 20 ps Memory (read/write) (instruction or data) 140 ps PC Register (read action) 20 ps PC Register (write action) 20 ps Register file (read action) 80 ps Register file (write action) 60 ps Logic (1 or more levels of gates) 10 ps Below is a copy of the LEGv8 single-cycle data path design. In this implementation the clock cycle is determined by the longest possible path in the machine. The critical paths for the different instruction types that need to be considered are:…
Assume that the state of the 8088’s registers and memory just prior to the executionof each instruction in problem 15 is as follows: * in photos*What result is produced in the destination operand by executing instructions (a)through (k)? *only h through k* (h) MUL DX(i) IMUL BYTE PTR [BX+SI](j) DIV BYTE PTR [SI]+0030H(k) IDIV BYTE PTR [BX][SI]+0030H
Assume that the state of the 8088’s registers and memory just prior to the executionof each instruction in problem 15 is as follows: * in photos*What result is produced in the destination operand by executing instructions (a)through (k)? *only b,c,e,g* b) ADC SI, AX(c) INC BYTE PTR [0100H] (e) SBB DL, [0200H] (g) NEG BYTE PTR [DI]+0010H
Th is exercise is intended to help you understand the relationship between forwarding, hazard detection, and ISA design. Problems in this exercise refer to the following sequence of instructions, and assume that it is executed on a 5-stage pipelined datapath:add r5,r2,r1lw r3,4(r5)lw r2,0(r2)or r3,r5,r3sw r3,0(r5)> If there is no forwarding or hazard detection, insert nops to ensure correct execution.> Repeat above step, but now use nops only when a hazard cannot be avoided by changing or rearranging these instructions. You can assume register R7 can be used to hold temporary values in your modifi ed code.> If the processor has forwarding, but we forgot to implement the hazard detection unit, what happens when this code executes?
Consider a HW ISA program P1 with the following Instruction Memory IM: Jamie wants to translate program P1 (except for the final HALT instruction) into a sequence of statements in a version of C with a 16-bit int type. Using the IM Fill in the rest of her program with assignments to variables named R2, R3, and R4 that represent the registers with these names in P1 and a while loop. int R0 = 0; int R1 = 1; int R2 = R0 + R0; // ...
Assuming stall-on-branch and no delay slots, what is the new clock cycle time and execution time of this instruction sequence if beq address computation is moved to the MEM stage? What is the speedup from this change? Assume that the latency of the EX stage is reduced by 20 ps and the latency of the MEM stage is unchanged when branch outcome resolution is moved from EX to MEM.
In the MIPS micro-architecture, the PC is incremented for each instruction, during the "Instruction Fetch" stage. The value of the PC may also be updated later within the "Memory Access" phase. * If the value of the PC is: 0x0000 2F1C, what is the value of the PC after you complete the execution of the instruction: ``addi $t0, $s0, $ra``?*
Consider the following instruction, discussed in Example 8.6: MAC *AR2+, *AR3+, A Suppose the processor has three ALUs, one for each arithmetic operation on the addresses contained in registers AR2 and AR3 and one to perform the addition in the MAC multiply-accumulate instruction. Assume these ALUs each require one clock cycle to execute. Assume that a multiplier also requires one clock cycle to execute. Assume further that the register bank supports two reads and two writes per cycle, and that the accumulator register A can be written separately and takes no time to write. Give a reservation table showing the execution of a sequence of such instructions.
Consider the following portions of three different programs running at the same time on three processors in a symmetric multicore processor (SMP). Assume that before this code is run, Total is 15, val_1 is 45, val_2 is 25, and val_3 is 5. Core 1: Total = Total + val_1;Core 2: Total = Total - val_2;Core 3: Total = Total + val_3; 1. Show the assembly code for both instructions. Assume that Total, var_1, and var_2 are stored at 0x0100, 0x0120, and 0x0130 respectively.2. What are all the possible resulting values of Total? For each possibleoutcome, explain how we might arrive at those values. You will need to show all possible interleavings of instructions.3. How could you make the execution more deterministic so that only one set of values is possible?
Suppose the state "Yout, MDRin, ALUadd, Zin" determines the fastest possible clock rate for a particular ISA implemented using this simple multicycle processor implementation. If the circuit delay associated with Yout is 1ns, MDRin is 2ns, ALUadd is 8ns, and Zin is 4ns, what is the length in ns of the shortest clock period that will ensure proper operation?