(15pt) Assume that instruction cache miss rate is 2%, data cache miss rate is 10%, CPI (clock cycle per instruction) is 2 without any memory stall, and miss penalty is 100 cycles. In addition, assume that the frequency of loads/stores is 30%. (a) Compute CPI with memory stall. (b) When CPI without any memory stall becomes 1, compute CPI with memory stall. (c) If the CPU clock rate is doubled with the same memory when CPI without memory stall is 2, compute CPI with memory stall.

(15pt) Assume that instruction cache miss rate is 2%, data cache miss rate is 10%, CPI (clock cycle per instruction) is 2 without any memory stall, and miss penalty is 100 cycles. In addition, assume that the frequency of loads/stores is 30%. (a) Compute CPI with memory stall. (b) When CPI without any memory stall becomes 1, compute CPI with memory stall. (c) If the CPU clock rate is doubled with the same memory when CPI without memory stall is 2, compute CPI with memory stall.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 2PE: If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the...

See similar textbooks

Similar questions

A(n) ________________ instruction always alters the instruction execution sequence. A(n) ______________ instruction alters the instruction execution sequence only if a specified Condition is true.
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?
Assume miss rate of an instruction cache is 2% and miss rate of data cache IS 4%, If a processor have CPI of 2 without any memory stalls and miss penalty is 100 cycles for all misses, determine how much faster a processor would run with a perfect cache that never missed. Assume frequency of all loads and stores is 36%.
On the Motorola 68020 microprocessor, a cache access takes two clock cycles. Data access from main memory over the bus to the processor takes three clock cycles in the case of no wait state insertion; the data are delivered to the processor in parallel with delivery to the cache. a. Calculate the effective length of a memory cycle given a hit ratio of 0.9 and a clocking rate of 16.67 MHz. b. Repeat the calculations assuming insertion of two wait states of one cycle each per memory cycle. What conclusion can you draw from the results?
Asap
Assume that the operation times of one add instruction for the major functional units are 325 ps for memory access, 185 ps for ALU operations and 125 ps for register file read/writes. Please fill the table first and perform the following a )What is the total cycle in single-cycle implementation? b )What is the total cycle in pipelining implementation? c) What is the total cycle in pipelining implementation if there are 5 million add instructions? d) What is the total cycle in pipelining implementation for 5 million add instructions, if the stages are balanced? e)What is the speed up of pipelining implementation over single-cycle implementation?
1. When a program is adapted to run on multiple cores in a multiprocessor system, the execution time on each core is comprised of computing time and the overhead time required for locked critical sections and/or to send data from one core to another. Assume a program requires t = 200 sec of execution time on one core. When run on n cores, each core requires t/n sec, as well as an additional 10 sec of overhead, irrespective of the number of cores. a. Compute the per-core execution time for 2, 4, 8, 16, 32, 64, and 128 cores. b. For each case, list the corresponding speedup relative to a single core and the ratio between actual speedup versus ideal speedup (speedup if there was no overhead).
The memory access time is 1 nanosecond for a read operation with a hit in cache, 5 nanoseconds for a read operation with a miss in cache, 2 nanoseconds for a write operation with a hit in cache and 10 nanoseconds for a write operation with a miss in cache. Execution of a sequence of instructions involves 100 instruction fetch operations, 60 memory operand read operations and 40 memory operand write operations. The cache hit-ratio is 0.9. The average memory access time (in nanoseconds) in executing the sequence of instructions will be ?
Answer the following questions. A. A computer system has a main memory access time as 60ns. you as a computer organization expert has been asked to reduce the memory access time to 20ns by adding a suitable cache. Assume that the miss probability is 10%. What should be the fastness of cache (in terms of access time) for this requirement? B. Consider the instruction ADD R1, X, which adds the contents of location X from the contents of register R1, and places the result in R1. Show the micro-operations used during fetch and execution phase of the instruction.
For the same instruction being executed: add $s1, $s2, $t0 using the following delays for each block/action: Decode + Register File Read Data Memory Access Instruction Register Read ALU (all Register Mux Memory Access operations) Write 25 200 |125 150 300 25 10 But, now assume that all types of instructions have to be executed in one clock cycle, not just the 'add' instruction. What is the minimum clock cycle from the times below which will suffice as the clock cycle time to run the microprocessor at? Choose the best answer. 845 535 545 835
Assume that an instruction cache misses 3% of the time and incurs a 100-cycle penalty for each miss. All ALU (r-format) instructions make up a program. Keep in mind that the base CPI is 1 when there are no delays. What is the current Consumer Price Index (CPI)?
find the average instruction time for single-cycle, multicycle, and pipelined datapaths.. Assume 2 ns for memory access, 2 ns for ALU operation, 1 ns for register read or write. Assume a program has 25% loads, 15% stores, 10% branches, 5% jumps, 45% R-type instructions. for pipelined execution assume: 30% of the loads are followed immediately by an instruction that uses the result of the load 40% of branches are mispredicted , branch delay on misprediction is 1 clock cycle