Computer Architecture problem

Problem 2.

Your task is to compare the memory efficiency of the four ISAs below:

AccumulatorAll operations occur between a single register and a memory location;

Memory-memoryAll three operands of each instruction are in memory;

StackAll operations occur on top of the stack. Only push and pop access memory. All

other instructions remove their operands from stack and replace them with the result. The implementation uses a stack for the top two entries. Accesses that use other stack positions are memory references;

Load-storeAll operations occur in registers, and register-to-register instructions have three operands per instruction. There are 16 general-purpose registers, and register specifiers are 4 bits long.

To measure memory efficiency, make the following assumptions:

The opcode is always 1 byte (8 bits);

All memory addresses are 2 bytes (16 bits);

All data operands are 4 bytes (32 bits);

All instructions are an integer number of bytes. There are no other optimizations to

reduce memory traffic, and variables A, B, C, and D are initially in memory.

Invent your own mnemonics and write the best equivalent assembly language code for the high- level-language fragment given below. Write the four code sequences for

A = B + C; B = A + C; D = A - B;

Calculate the instruction bytes fetched and the memory-data bytes transferred.

Which ISA is most efficient as measured by code size?

Which ISA is most efficient as measured by total memory bandwidth required (code +

data)?