Question 3) For the CPU architecture given in slide 17 of lecture-3 notes, find the instruction binary encodings for the program shown below and fill in the instruction memory table. You must use 3 instructions at most. Assume every address in instruction memory stores a single 16-bit instruction and the program is stored in instruction memory starting from address 0. Also, assume all CPU registers are 8-bits wide and all initially contain OxFF value. In the program below, assume variable "a" is mapped to RO register and R1 is used as a temporary register for calculations. For deriving the encoding for each instruction, show the values of individual control word bits and explain why those bits are selected as such. unsigned int a = 5;//const 5 is an immediate value that is stored into a which is mapped to RO a = a*5; //Multiply a by 5 and store the result back to a in RO

Question 3) For the CPU architecture given in slide 17 of lecture-3 notes, find the instruction binary encodings for the program shown below and fill in the instruction memory table. You must use 3 instructions at most. Assume every address in instruction memory stores a single 16-bit instruction and the program is stored in instruction memory starting from address 0. Also, assume all CPU registers are 8-bits wide and all initially contain OxFF value. In the program below, assume variable "a" is mapped to RO register and R1 is used as a temporary register for calculations. For deriving the encoding for each instruction, show the values of individual control word bits and explain why those bits are selected as such. unsigned int a = 5;//const 5 is an immediate value that is stored into a which is mapped to RO a = a*5; //Multiply a by 5 and store the result back to a in RO

Name: Question 3) For the CPU architecture given in slide 17 of lecture-3 n
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Question 3) For the CPU architecture given in slide 17 of lecture-3 notes, find the instruction binaryencodings for the program shown below and fill in the instruction memory table. You must use 3instructions at most.Assume every address in instruct

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

If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the fetch cycle is 40% of the processor cycle time, what memory access speed is required to implement load operations with zero wait states and load operations with two wait states?
QuedT: Choose the correct answer: [ Opcode, funct3 and funct7/6 in instruction format are used to identify the: (a) function. (b) instruction. (e) branch. (d) memory address. The register that hold the address of the current instruction being executed is called: (a) saved register. (b) global pointer. (e) stack pointer. (d) program counter. Placing the executable file into the memory for execution by the processor is the role of (a) assembler. (b) linker. (e) loader. (d) compiler. The part which responsible for transmitting the data to/from the processor is: (a) control unit. (b) Datapath. (c) data bus. (d) memory. Parallel hardware cannot be used for faster division because: (a) subtraction is conditional on sign of remainder. (b) multiplication is conditional on sign of remainder. (c) subtraction is conditional on sign of divisor. (d) multiplication is conditional on sign of divisor. we cannot slower the clock cycle to fit the floating-point adder algorithm into one clock cycle…
Problem 1. This problem is about operand modes, in particular about memory addressing using the operand modes described in lecture and the textbook. The following shows the contents of a portion of the program memory (locations Ox10000 through 0x10040), and certain registers. All contents are 64-bit quantities. Address Memory Contents 0x10040 0x10038 0x10030 0x10028 0x10020 0x10018 0x10010 0x10008 0x10000 a. movq (%rdi), %rax b. movq (%rdi,%rsi), %rax 100 0x10040 200 25 0x10028 0x10020 c. movq 8(%rdi, %rcx, 4) %r8 d. movq -8(%rdi,%rsi), rbx 500 0x10018 2 Register Contents %rdi 0x10008 %rsi %rdx %rcx For each of the following instructions, say what value ends up in the destination register. Each instruction starts with the state shown above, i.e., the effects do not accumulate. 0x20 8 4
Question 1: MIPS assembly to machine code Convert the following MIPS instruction into machine language. If a field of the machine code is not defined, enter all Os for that field. For J-type instructions, the argument is a 32-bit address. You may assume that the 4 most-significant bits of this address are the same as the instruction's address in the instruction memory (i.e., PC+4[31:28] is the same as argument[31:28]) lw $21, 16($9) Machine Code = XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX Your answer should consist of 32 ones and zeros. Feel free to uses spaces to group your bits; we'll remove them before checking your answer. A copy of the MIPS_green_sheet.pdf is available for your reference
Assignment-04. A non-pipelined CPU has 12 general purpose registers (RO, R1, R2, . Following operation are supported: R12), .... ADD Ra, Rb, Rr Add Ra to Rb and store the result in Rr MUL Ra, Rb, Rr Multiply Ra to Rb and store the result in Rr MUL operations takes two dlock cycles, ADD takes one clock cycle. Calculate minimum number of clock cycles required to compute the value of the expression XY +XYZ + YZ The variables X,Y, Z are initially available in registers RO, R1 and R2 and contents of these registers must not be modified,
what is the maximum number of opcodes
Q2. For the following assume that values A, B, C, D, E, and F reside in memory. Also assume that instruction operation codes are represented in 6 bits, memory addresses are 64 bits, data size is 32 bits and register addresses are 5 bits. a. For each instruction set architecture shown in Figure A.1, how many addresses or names (including both memory and register), appear in each instruction for the code to compute C = A+ B, and what is the total code size? passor TOS Memory (A) Accumulator (C) Registry (D) Re loed oore Figure A.1 Operand locations for four instruction set architecture classes. The arrows indicate whether the oper and is an input or the result of the orithmetic-logical unit ALU operation, or both an input and result Lighter shoes indicate inputs, and the dark shode indicates the result in a top of stack (TOS) register points to the top input operand, which is combined with the operand below. The first operand is removed from the stack, the result takes the place of the…
Choose the correct answer: Opcode, funct3 and funct7/6 in instruction format are used to identify the: ● (a) function. (b) instruction. (c) branch. (d) memory address. The register that hold the address of the current instruction being executed is called: (a) saved register. (b) global pointer. (e) stack pointer. (d) program counter. Placing the executable file into the memory for execution by the processor is the role of: (a) assembler. (b) linker. (e) loader. (d) compiler. ● The part which responsible for transmitting the data to/from the processor is: (a) control unit. (b) Datapath. (c) data bus. (d) memory. ● ● Parallel hardware cannot be used for faster division because: (a) subtraction is conditional on sign of remainder. (b) multiplication is conditional on sign of remainder. (c) subtraction is conditional on sign of divisor. (d) multiplication is conditional on sign of divisor. ● we cannot slower the clock cycle t fit the floating-point adder algorithm into one clock cycle…
Microprocessors
Q1:/ Show the contents in hexadecimal of registers PC, AR, DR, AC, IR and SC of the basic computer when an instruction at address 021 in the basic computer has I = 1, an operation code of the ADD instruction, and an address part equal to 051. The memory word at address 051 contains 0083. The memory word at address 083 contains B8F2. The memory word at address 038 contains A837 and the content of AC is A937. Give the answer in a table with six columns, one for each register and a row for each timing signal. (All numbers are in hexadecimal) uipors - ea
For each question, give the following three values for the last line of each code block following the execution of the entire block: 1. the memory address which that line writes to, 2. the value that is written to that address, and 3. the number of distinct memory reads required by that line. If you cannot determine the memory address from the information given, enter 0 for the address. When computing the number of memory reads, assume nothing about the value of registers prior to the execution of the last statement: count a read even if the previous line also read (or wrote) the location. Count the number of distinct memory locations read by that statement; that is, if the line reads a memory location multiple times, count it only once. Assume that memory accesses always succeed, i.e. that all memory addresses are accessible to the program. For example, for the following code block: int *foo (int *)0x1000; int *bar = (int *)0x1000; *foo = 1; *foo=foo + *bar + 1; you would answer…
Quesde: Choose the correct answer: Opcode, funct3 and funct7/6 in instruction format are used to identify the: (a) function. (b) instruction. (c) branch. (d) memory address. The register that hold the address of the current instruction being executed is called: (a) saved register. (b) global pointer. (e) stack pointer. (d) program counter. Placing the executable file into the memory for execution by the processor is the role of (a) assembler. (b) linker. (e) loader. (d) compiler. The part which responsible for transmitting the data to/from the processor is: (a) control unit. (b) Datapath. (e) data bus. (d) memory. Parallel hardware cannot be used for faster division because: (a) subtraction is conditional on sign of remainder. (b) multiplication is conditional on sign of remainder. (e) subtraction is conditional on sign of divisor. (d) multiplication is conditional on sign of divisor. we cannot slower the clock cycle to fit the floating-point adder algorithm into one clock cycle…