Instruction 125-01 Shift 26 left 2 Add Jump address (31-0) 28 PC 431-28 RegDat Shin Jeft 2 Jump Branch MemRead Instruction 31-26] MemoReg Control A MemWrite ALUS RegWrite ALU Instruction (25-21] Read PC Read address register 1 Read Instruction [20-16 data1 Read Zero Instruction register 2 01-0 Read Instruction Instruction (15-11 memory Write Write data Registers ALU ALU register data 2 result Instruction[15-0 16 Sign- 32 extend ALU control Instruction (5-0 23x эм AddressRead data We Data data memory

Instruction 125-01 Shift 26 left 2 Add Jump address (31-0) 28 PC 431-28 RegDat Shin Jeft 2 Jump Branch MemRead Instruction 31-26] MemoReg Control A MemWrite ALUS RegWrite ALU Instruction (25-21] Read PC Read address register 1 Read Instruction [20-16 data1 Read Zero Instruction register 2 01-0 Read Instruction Instruction (15-11 memory Write Write data Registers ALU ALU register data 2 result Instruction[15-0 16 Sign- 32 extend ALU control Instruction (5-0 23x эм AddressRead data We Data data memory

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 11VE: Most Intel CPUs use the __________, in which each memory address is represented by two integers.

See similar textbooks

Similar questions

A(n) ________________ instruction always alters the instruction execution sequence. A(n) ______________ instruction alters the instruction execution sequence only if a specified Condition is true.
A(n) __________ is a storage location implemented in the CPU.
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?
The time it takes to perform the fetch instruction and decode instruction steps is called the execution time. True or false?
How does pipelining improve CPU efficiency? What’s the potential effect on pipelining’s efficiency when executing a conditional BRANCH instruction? What techniques can be used to make pipelining more efficient when executing conditional BRANCH instructions?
Processor R is a 64-bit RISC processor with a 2 GHz clock rate. The average instruction requires one cycle to complete, assuming zero wait state memory accesses. Processor C is a CISC processor with a 1.8 GHz clock rate. The average simple instruction requires one cycle to complete, assuming zero wait state memory accesses. The average complex instruction requires two cycles to complete, assuming zero wait state memory accesses. Processor R can’t directly implement the complex processing instructions of Processor C. Executing an equivalent set of simple instructions requires an average of three cycles to complete, assuming zero wait state memory accesses. Program S contains nothing but simple instructions. Program C executes 70% simple instructions and 30% complex instructions. Which processor will execute program S more quickly? Which processor will execute program C more quickly? At what percentage of complex instructions will the performance of the two processors be equal?
In many CPUs, a register called the _____ stores bit flags representing CPU and program status, including those representing processing errors and the results of comparison operations.
Two 1-bit values generate a 1 result value when a(n) _____ instruction is executed. All other input pairs generate a 0 result value.
The contents of a memory location are copied to a register while performing a(n) __________________ operation.