Operating Systems and Networking Coursework Example | Topics and Well Written Essays - 1250 words

Operating Systems and Networking - Coursework Examplethe following fields opcode 8 bitsra 6 bits rb 6 bitsrc 6 bitsrd 6 bitswhere ra, rb, rc, specify three input registers and rd specifies one term register. If there is a single register file to store the identifications of all registers, how many registers could there be in that register file?1.3. A processor has 24 registers, uses 8-bit immediate, and has 36 different book of instructions (corresponding to 36 operation codes) in its instruction set. These 36 instructions are classified into 4 types as listed belowAssume that the ISA requires that all instructions be multiple of 8 bits (1 byte) in length, and the operation codes (opcodes) are icy length. Answer the following questions and write down the calculation steps involved.Type C 6 bits of the operation code, 5 bits for the source register, 8 bits of the immediate, and 5 bits of the destination register. This totals to 19 bits. These are rounded up again to 24 bits. 24 bit s are equivalent to 3 bytes. Therefore 3 bytes are required to convert type c instruction.The pipelining diagram is used to show the execution of a series or a age of instructions of processes of a computer. In the diagram, the sequence of instructions is shown vertically that is from the top to the bottom. As for the clock cycles, they are often shown in the horizontal that is from the left to the right. Each and every instruction is divided into its office stages.There are 3 instructions. Suppose a non-pipelining processor took 50 Nano seconds to process one instruction, and then it would take 3 * 50 = 150 Nano seconds to realized all the instructions. However when pipelining is used, we instead nonplus 4 segment pipeline with a clock cycle that takes at least 10 Nano seconds approximately.2.2. Suppose we have a slightly more complex program with data dependency and branches. Assume that in the case of branching, the instruction following a branch is unendingly executed. Not e that a conditional branch