Computer Architecture · Instruction-set architecture and assembly semantics
A processor uses 32-bit little-endian memory and 32-bit instructions that are always…
Problem
A processor uses 32-bit little-endian memory and 32-bit instructions that are always aligned to a multiple of 4. An instruction \(I\) occupies addresses `0x00001000` through `0x00001003`. Memory bytes are: - address `0x00001000` contains `0x13` - address `0x00001001` contains `0xA5` - address `0x00001002` contains `0x00` - address `0x00001003` contains `0x00` - address `0x00001004` contains `0x93` - address `0x00001005` contains `0x05` - address `0x00001006` contains `0x20` - address `0x00001007` contains `0x00` Determine the 32-bit instruction word fetched from `PC = 0x00001000`, and the 32-bit instruction word fetched from `PC = 0x00001004`. Give both results as eight hexadecimal digits.
Hint
Little-endian means the byte at the smallest address is the least-significant byte of the 32-bit word.
Check your work
Work the problem yourself first. Then open it in Training to check your answer and read the full worked solution.
Create a free account to check your answer and see the solution. Create a free account.
More Computer Architecture practice problems
- Encode each of the decimal integers -73, -1, 0, 1, and 119 as an 8-bit two's-complement…Instruction-set architecture and assembly semantics
- IEEE-754 binary32 operations are performed with round-to-nearest, ties-to-even, and…Datapath and control implementation
- A J-type jump instruction has the 32-bit encoding `0x0810000F`Datapath and control implementation
- A 32-bit multi-cycle RISC processor executes the six-instruction sequence below…Pipelining, hazards, and speculation
- Register file contents before execution, all values 32-bit two's complement: x1 =…Pipelining, hazards, and speculation
- A 5-stage in-order pipeline (IF, ID, EX, MEM, WB) issues at most one instruction per…Caches, virtual memory, and memory hierarchy
- A MIPS-style delayed branch has a 1-instruction delay slot that is always executed…Caches, virtual memory, and memory hierarchy
- A shared bus has three masters M_0,M_1,M_2 and a nonpreemptive round-robin arbiterI/O, interrupts, and concurrency
- Roofline time is the max of a compute ceiling and a bandwidth ceilingParallel architecture and performance limits