create the fetch-execute cycle for an instruction that moves a value from general-purpose register-1 to general-purpose register-2. compare the cycle to the cycle for a load instruction. What is the major advantage of the MOVE over the LOAD?
Major advantage of MOVE over LOAD:
MOVE is faster than LOAD because it occurs between two registers where as move occurs between two memory locations. Registers are always faster than main memory
Cycles of Move:
REG1 -> MAR
MDR -> IR
IR -> MAR
MDR -> REG2
PC + 1 -> PC
Cycle for LOAD:
PC -> MAR
MDR -> IR
IR -> MAR
MDR -> A
PC +1 -> PC
create the fetch-execute cycle for an instruction that moves a value from general-purpose register-1 to general-purpose...
The system will fetch and execute 3 lines of code
only. The PC register will be incremented by 1 after each
fetch.....Can someone help me with this? If possible can you write
your answer on paper and take a picture, its easier for me to
understand
A word is equal to 12 bits The system will fetch and execute 3 lines of code only The PC register will be incremented by 1 after each fetch. Show final values in binary...
3. Use any one of the following instructions to explain the steps of the fetch-decode- execute cycle. Your explanation should include what is happening in the related registers. (10 points) Binary Contents of Hex Contents Memory Address Address Instruction of Memory 100 Load 104 0001000100000100 101 Add 105 102 Store 106 0100000100000110 103 Halt 104 0023 105 FFES 106 0000 1104 0011000100000101 4106 7000 0111000000000000 0000000000100011 0023 FEE9
3. Use any one of the following instructions to explain the steps...
Goals: To learn general-purpose register architectures. To learn encoding an instruction set. Questions: 100 points: (1) 30 points, (2) 70 points 1. (30 points) The design of MIPS provides for 32 general-purpose registers and 32 floating-point registers. If registers are good, are more registers better? List and discuss as many trade-offs as you can that should be considered by instruction set architecture designers examining whether to, and how much to increase the numbers of MIPS registers. 2. [70 points] Consider...
A 5-Stage pipeline is composed
of the following stages Instruction Fetch (IF), Decode (DE),
Execute (EX), Memory Access (ME) and Register Write-back (WB).
Assume the pipeline does not have a branch prediction unit, does
not have superscalar support and does not support out of order
execution. Assume that all memory accesses are in the L1 cache and
therefore do not introduce any stalls. Show a pipeline diagram that
shows the execution of each stage for the assembly code below. Also...
1. Explain the steps in the fetch–decode–execute cycle. Your explanation should include what is happening in the various registers. 2. Explain why, in MARIE, the MAR is only 12 bits wide and the AC is 16 bits wide. (Hint: Consider the difference between data and addresses.)
A particular (fictional) CPU has the following internal units and timings: 1. IFD: Instruction fetch + decode : 160 ps 2. RR: Register read 80 ps 3. ALU: 240 ps 4. MA : memory access: 160 ps (assuming cache) 5. RW : register write : 80 ps There are 5 basic instruction types: 1. LOAD : IFD+RR+ALU+MA+RW 720 ps 2. STORE: IFD+RR+ALU+MA : 640 ps 3. ARITHMETIC: IFD+RR+ALU+RW : 560 4. BRANCH: IFD+RR+ALU : 480 ps 5. MEMOP: IFD+RR+MA+ALU+MA :...
b. A microprocessor has an instruction set that consists of 117 instructions, which need fetch, decode, read operand, execute, write and interrupt stages. Assume that as an average, each stage requires three micro- operations to complete. Also, assume that the control memory is N bits wide (i.e., control field bits + address selection field bits + address-one bits + address-two bits N bits). The control field bits are 15 and there are 15 flags to be monitored. i. How many...
computer architecture and organization
Figure Q20 shows a space time diagram to execute n instructions by CAOTM processor The instruction cycle comprises 4 steps; fetch (F), decode (D), execute (E), and write back (W). Assume 1 clock cycle= 10 ns. 10 20 30 40 50 60 70 80 90 100 110 120 130 Time, ns Cycle Instruction- 1 2 3 4 6 7 8 9 10 11 13 1 F D E E W 2 F E E W D...
Instruction set architecture R: register X, Y, Op1, Op2: Operand Quantity: constant value EA: Effective memory address Opcode Operation Name MOV X Y XCH Opl, Op2 ADD X, Y SUB X, Y SAL Op. Quantity SAR Op. Quantity SHR Op Quantity AND X, Y OR X. Y XOR X, Y NOT X LOAD RA LOAD R. (A) STORERA STORE R. (A) Description Move data from Y to X Exchange Opl with Op2 X=X+Y X=Y-X Shift Arithmetic Left on Op for...
Table 1: Load 26% Compare 14% Shift left and shift right 4% Store 9% Load immediate 4% AND 3% Add 14% Conditional branch 17% OR 5% Sub 0% Jump 1% Other register-register instructions (XOR, NOT, etc.) 1% Multiply 0% Call 1% Divide 0% Return 1% Using the data in Table 1, which of the following two enhancements will result in faster execution of the five benchmark programs that are described by the instruction frequency data? Assume that the computer used...