## Department of Electrical and Computer Engineering

### The University of Texas at Austin

EE 360N, Fall 2003
Problem Set 1
Due: 10 September 2003 8 September 2003, before class
Yale N. Patt, Instructor
Santhosh Srinath, Danny Lynch, TAs

Instructions:
You are encouraged to work on the problem set in groups and turn in one problem set for the entire group. Remember to put all your names on the solution sheet. Also remember to put the name of the TA in whose discussion section you would like the problem set turned back to you.

1. Briefly explain the difference between the microarchitecture level and the ISA level in the transformation hierarchy.
2. What information does the compiler need to know about the microarchitecture of the machine for which it's compiling code? Explain.
3. This Problem is optional.

Both of the following programs cause the value x0004 to be stored in location x3000, but they do so at different times. Explain the difference.

• ```
.ORIG x3000
.FILL x0004
.END
```
• ```	.ORIG x4000
AND R0, R0, #0
LEA R1, A
LDW R1, R1, #0
STW R0, R1, #0
HALT
A	.FILL x3000
.END
```
4. Classify the LC-3b instructions into Operate, Data Movement, or Control instructions.
5. At location x3E00, we would like to put an instruction that does nothing. Many ISAs actually have an opcode devoted to doing nothing. It is usually called NOP, for NO OPERATION. The instruction is fetched, decoded, and executed. The execution phase is to do nothing! Which of the following three instructions could be used for NOP and have the program still work correctly?

1. 0001 001 001 1 00000
2. 0000 111 000000001
3. 0000 000 000000000

What does the ADD instruction do that the others do not do?

6. This Problem is optional.

Consider the following LC-3b assembly language program:

```	.ORIG x3000
AND R5, R5, #0
AND R3, R3, #0
LEA R0, B
LDW R1, R0, #1
LDW R1, R1, #0
BRp AGAIN
LDW R4, R0, #0
AND R1, R1, R4
NOT R1, R1
BRnp NO
NO	HALT
B	.FILL XFF00
A	.FILL X4000
.END
```
1. The assembler creates a symbol table after the first pass. Show the contents of this symbol table.
2. Assemble this program. Show the LC-3b machine code for each instruction in the program as a hexadecimal number.
3. What does this program do?
4. When the programmer wrote this program, he/she did not take full advantage of the instructions provided by the LC-3b ISA. Therefore the program executes too many unnecessary instructions. Show what the programmer should have done to reduce the number of instructions executed by this program.
7. Consider the following LC-3b assembly language program.
```	.ORIG	x4000
MAIN	LEA	R2,L0
JSRR	R2
JSR	L1
HALT
;
RET
;
RET
```
This program shows two ways to call a subroutine. One requires two instructions: LEA, JSRR. The second requires only one instruction: JSR. Both ways work correctly in this example. Is it ever necessary to use JSRR? If so, in what situation?
8. Name the different addressing modes supported by the LC-3b. Briefly describe each and give an example.
9. Consider the following possibilities for saving the return address of a subroutine:
• In a processor register.
• In a memory location associated with the subroutine. A different memory location is used for each different subroutine.
• On a stack.
Which of these possibilities supports subroutine nesting, and which supports subroutine recursion (that is, a subroutine that calls itself)?
10. A small section of byte-addressable memory is given below:
x1005 x0A
x1004 x0B
x1003 x0C
x1002 x11
x1001 x1A
x1000 x0E
x0FFF x25
x0FFE xA2

Add the 16-bit two's complement numbers specified by addresses 0x1000 and 0x1002 if:
• The ISA specifies a little-endian format
• The ISA specifies a big-endian format
11. Say we have half a billion bits of storage, calculate the number of bits required to address a location if
3. The ISA is 128-bit addressable
12. This Problem is optional.

Write an LC-3b program that swaps the values in R1 and R2 without using any other registers. Make sure that your program works for any possible values in R1 and R2.

• A zero-address machine is a stack-based machine where all operations are done by using values stored on the operand stack. For this problem, you may assume that its ISA allows the following operations:
• PUSH M - pushes the value stored at memory location M onto the operand stack.
• POP M - pops the operand stack and stores the value into memory location M.
• OP - Pops two values off the operand stack and performs the binary operation OP on the two values. The result is pushed back onto the operand stack.

• A one-address machine uses an accumulator in order to perform computations. For this problem, you may assume that its ISA allows the following operations:
• LOAD M - Loads the value stored at memory location M onto the accumulator.
• STORE M - Stores the accumulator value into Memory Location M.
• OP M - Performs the binary operation OP on the value stored at memory location M and the value present in the accumulator. The result is stored back in the accumulator.

• A two-address machine takes two sources, performs an operation on these sources and stores the result back into one of the sources. For this problem, you may assume that its ISA allows the following operation:
• OP M1, M2 - Performs a binary operation OP on the values stored at memory locations M1 and M2 and stores the result back into memory location M1.

Note: OP can be ADD or MUL for the purposes of this problem.

1. Write the assembly language code for calculating the expression:
x = (A * ( ( B * C ) + D ) )