Urgently need QUESTION 1Which of these are advantages of dynamic instruction scheduling?allows multiple functional units to continue working, even if instruction issue stallscan be performed by the compilerO prevents delays caused by cache misses from stalling the pipelineQUESTION 2In dynamic scheduling, instructions are fetched out of order.TrueO FalseQUESTION 3In dynamic scheduling, instructions can complete out of order.TrueFalseQUESTION 4The compiler can perform register renaming to eliminate name dependences.TrueO False

Note: There are multiple questions are given in one question. According to the rule, you will get…

Answered: QUESTION 2 In dynamic scheduling,…

Engineering

Computer Science

QUESTION 2 In dynamic scheduling, instructions are fetched out of order. True False QUESTION 3

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 10RQ: How does pipelining improve CPU efficiency? What’s the potential effect on pipelining’s efficiency...

See similar textbooks

Similar questions

10. Q1 : What is an atomic instruction? Show that if the wait operation is not executed atomically, then mutual exclusion may be violated Q2: What is spinlock? Discuss the advantage and disadvantage of using spinlock. Why do you think Solaris, Linux, and Windows 2000 use spinlocks as a synchronization mechanism only on multiprocessor systems and not on single- processor systems?
. Consider a system that has multiple processors where eachprocessor has its own cache, but main memory is shared among allprocessors.1. a) Which cache write policy would you use?2. b) The cache coherency problem. With regard to the systemjust described, what problems are caused if a processor has acopy of memory block A in its cache and a second processor,also having a copy of A in its cache, then updates mainmemory block A? Can you think of a way (perhaps morethan one) of preventing this situation, or lessening itseffects?
Uniprogramming typically provides better utilization of system resources than multiprogramming. (T/F). A fetched instruction is normally loaded into the Instruction Register (IR). (T/F) If a kernel is single-threaded, system calls from any thread can block the entire task .(T/F) Solid state drives are less reliable than conventional Magnetic hard drives. (T/F) The less-privileged processor execution mode is often referred to as kernel mode. (T/F) The Dining Philosopher’s Problem illustrates basic problems in deadlock and starvation. (T/F)
Please help me in these following questions: 1/ The LEGv8 processor in the book demonstrated multiple issue using __________ . a. dynamic dual issue b. dynamic quad issue c. static dual issue d. static quad issue 2/ A stall in the pipeline is indicated by the compiler using a(n) __________ instruction. a.branch b. exception c. nop d. delay 3/ The CPU is updated on the __________ . a. low clock value b. falling clock edge c. rising clock edge d. high clock value 4/ If an exception occurs in the pipeline, the following must occur. a. Flush all instructions b. Complete instructions before the exception, flush the instructions following the exception c. Complete instructions before the exception, save the registers of the instructions following the exception d. Complete all instructions except for the failed instruction 5/ Dynamic multiple issue occurs __________ . a. at compile time b. when the CPU fetches instructions c. when a hazard invalidates an instruction d. when a…
a) Suppose two threads T1 and T2 are running concurrently in the same process with a single CPU. Suppose T1 does “Load X into register R1” machine instruction. Then the CPU scheduler switches the CPU to T2. Will T2 see the same vaue of R1 as loaded here by T1? (YES or NO)? Explain in less than 50 words. Be specific. (b) Suppose two threads T1 and T2 are running concurrently in the same process with a single CPU. Is it possible to have a moment (time instant) where both threads have made a request to Memory Unit to read some data (ex. as part of a “Load … into register …” instruction) and Memory Unit has not yet completed either of these two requests? Explain in less than 50 words.
Consider the following instruction:Instruction: Add Rd, Rs, RtInterperation: Reg[Rd] = Reg[Rs] + Reg[Rt] RegWrite MemRead ALUMux MemWrite ALUOp RegMux Branch a, What are the values of control signals generated by the control in Figure 4.2 for the above instruction? b, Which resources (blocks) perform a useful function for this instruction? c, Which resources (blocks) produce outputs, but their outputs are not used for this instruction? d, which resources (blocks) produce no output for this instruction?
How does pipelining improve CPU efficiency? What’s the potential effect on pipelining’s efficiency when executing a conditional BRANCH instruction? What techniques can be used to make pipelining more efficient when executing conditional BRANCH instructions?
Consider the following three CPU organizations:CPU SS: A 2-core superscalar microprocessor that provides out-of-order issue capabilities on 2 function units (FUs). Only a single thread can run on each core at a time.CPU MT: A fi ne-grained multithreaded processor that allows instructions from 2 threads to be run concurrently (i.e., there are two functional units), though only instructions from a single thread can be issued on any cycle. CPU SMT: An SMT processor that allows instructions from 2 threads to be run concurrently (i.e., there are two functional units), and instructions from either or both threads can be issued to run on any cycle. Assume we have two threads X and Y to run on these CPUs that include the following operations: Thread X Thread Y A1 – takes 3 cycles to executeA2 – no dependences A3 – conflicts for a functional unit with A1A4 – depends on the result of A3 B1 – take 2 cycles to executeB2 – confl icts for a functional unit with B1B3 – depends on the result of…
A particular (fictional) CPU has the following internal units and timings (WRand RR are write/read registers,ALU does all logic and integer operations and there is a separate floatingpoint unit FPU. Timings for each unit in picoseconds are:IR 230, RR 40, WR 50, ALU 200, MEM 260, FPU 380(assume instruction read and memory access are average time for access tocache)There are 5 basic instruction types: - here are instruction sequence for eachtype, time in picoseconds and percentage of each type in a typical set of testcodes:1. LOAD : IR+RR+ALU+MEM+WR : 780, 20%2. STORE: IR+RR+ALU+MEM : 730, 10%3. LOGIC/INTEGER: IR+RR+ALU+WR : 520, 40%4. FLOATING POINT: IR+RR+FPU+WR : 700, 10%5. BRANCH: IR+RR+ALU : 270, 20%1 cycle is 780ps = .780 nanoseconds for this machine, on the assumption thatall instructions take 1 cycle (assume all memory access is in cache). Clockfrequency is 1/.780 = 1.28 GHz (rounded to 2 decimals) for an ideal CPI=1
Due: Jan 4 Assignment 1 Compare performance for single-cycle, multicycle, and pipelined datapaths vy calculating execution time for each using the gcc instruction mixassume 2 ns for memory access, 2 ns for ALU operation, 1 ns for register read or writeassume gcc instruction mix 23% loads, 13% stores, 19% branches, 2% jumps, 43% ALUfor pipelined execution assume50% of the loads are followed immediately by an instruction that uses the result of the load25% of branches are mispredictedbranch delay on misprediction is 1 clock cyclejumps always incur 1 clock cycle delay so their average time is 2 clock cycles
Assume a 3GHz processor executes three classes of instructions(A, B, C).i. Calculate the average CPI for this sequence of program.ii. Calculate the execution time for this sequence of program.iii. If we use a system with four same processors, there will bespeed up by a factor of 4 for classes A and C, but class B willremain unaffected. Calculate the new execution time for thissystem. What is the overall speed up? Class A B C CPI for class 4 2 10 IC in sequence 100 200 300
4.0 You are building a computer with a hierarchical memory system that consists of separate instruction and data caches followed by main memory. You are using a MIPS single cycle processor running at 2.5 GHz. 4.0.1 Suppose the instruction cache is perfect (i.e., always hits) but the data cache has a 5.5 % miss rate. On a cvache miss, the processor stalls for 40 ns to access main memory, then resumes normal operation. Taking cache misses into account, what is the average memory access time? 4.0.2 Consider a benchmark application that has 20% loads, 15% stores, 10% branches, and 55% data processing instructions. Taking the non-ideal memory system into account, what is the average CPI for this benchmark? 4.0.3 Now suppose the instruction cache is also non-ideal and has a 2.5% miss rate. What is the average CPI for the benchmark in 4.0.2? Take into account both instruction and data cache misses.