A compiler designer is trying to decide between two code sequences for a particular machine. The hardware designers have supplied the following facts: Instruction class CPI of the instruction class A 1 B 3 C 4 For a particular high-level language, the compiler writer is considering two sequences that require the following instruction counts: Code sequence Instruction counts (in millions) A B C 1 2 1 2 2 4 3 1 a. What is the CPI for each code sequence? b. Which code sequence is faster? By how much

Discuss the role of compiler optimizations in maximizing the effectiveness of instruction pipelines.

dont dont psot copied one sure and strict doownvote sure sure dislike

PLEASE DON'T USE STRUCTS Using C programming language write a program that simulates a variant of the Tiny Harvard Architecture. In this implementation memory (RAM) is split into Instruction Memory (IM) and Data Memory (DM). Your code must implement the basic instruction set architecture (ISA) of the TinyMachine Architecture: 1 -> LOAD 2->ADD 3->STORE 4 -> SUB 5 ->IN 6-> OUT 7-> END 8 -> JMP 9 -> SKIPZ Each piece of the architecture must be accurately represented in your code (Instruction Register, Program Counter, Instruction Memory (IM), MAR1, MDR-1(MAR-1 and MDR-1 are connected to the IM). Data Memory, MAR-2, MDR2 (MAR-2 and MDR-2 are connected to the DM), and Accumulator. Instruction Memory will be represented by an integer array and each instruction will use 2 elements of the array(one for OP and the other one for address) Data Memory will be represented by an integer array and each data value uses an element of the DM array. Your Program Counter will begin pointing to the first…