5. MLP with ROB & RS (2 points - Completeness): Assume a Tomasulo-type machine with 64 reservation stations and 128 reorder buffer entries. For both the programs below assume that the first load from memory misses in all caches (just in first iteration and no misses further) and thus has a latency of 600 cycles and the subsequent loads hit in Ll cache and have a short latency of 2 cycles. (Reservation Stations: Instructions wait for their operands to get ready in the Reservation Stations so that they can move into execution.) Program 1: L1: mov 0(%edi) %eax add %eax %ebx sub %ebx %ecx add %ecx %edx sub $4 %edi cmp $0 %edi jne L1 Program 2: L1: mov 0%edi) %eax add %eax %ebx sub %ebx %ecx add %ecx %edx sub %edx %edi cmp $0 %edi jne L1 (a) For Program 1 which one is likely to get filled up first Reservation station or ROB? (b) For Program 2 which one is likely to get filled up first Reservation station or ROB? 5. MLP with ROB & RS (2 points - Completeness): Assume a Tomasulo-type machine with 64 reservation stations and 128 reorder buffer entries. For both the programs below assume that the first load from memory misses in all caches (just in first iteration and no misses further) and thus has a latency of 600 cycles and the subsequent loads hit in Ll cache and have a short latency of 2 cycles. (Reservation Stations: Instructions wait for their operands to get ready in the Reservation Stations so that they can move into execution.) Program 1: L1: mov 0(%edi) %eax add %eax %ebx sub %ebx %ecx add %ecx %edx sub $4 %edi cmp $0 %edi jne L1 Program 2: L1: mov 0%edi) %eax add %eax %ebx sub %ebx %ecx add %ecx %edx sub %edx %edi cmp $0 %edi jne L1 (a) For Program 1 which one is likely to get filled up first Reservation station or ROB? (b) For Program 2 which one is likely to get filled up first Reservation station or ROB