ii. Level 1 cache uses a 'hit rate' to determine the percentage of data and instructions...
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
ii. Level 1 cache uses a 'hit rate' to determine the percentage of data and instructions that are needed by registers found in level 1 cache. Typically, the hit rate of modern level 1 cache is just under 100%. Suppose that 1800 words of data need to be moved into the registers. If the hit rate is 96%, how many words are found in level 1 cache? iii. If the hit rate of the level 1 cache is instead 98%, how many words are found in level 1 cache? iv. It takes 1 nanosecond (1 x 10- seconds) to move a word from L1 cache to the registers and 10 nanoseconds to move a word from L2 cache to the registers. Assuming that all of the words that are not in L1 cache are in L2 cache, what is the percentage reduction in the time it takes to get the 1800 words of data into the registers if the hit rate is increased from 96% to 98%? Round your answer to the nearest tenth of a per cent. Hint: start by calculating the time to load the words available from L1 cache plus the time to load those from L2 cache, for each hit rate. ii. Level 1 cache uses a 'hit rate' to determine the percentage of data and instructions that are needed by registers found in level 1 cache. Typically, the hit rate of modern level 1 cache is just under 100%. Suppose that 1800 words of data need to be moved into the registers. If the hit rate is 96%, how many words are found in level 1 cache? iii. If the hit rate of the level 1 cache is instead 98%, how many words are found in level 1 cache? iv. It takes 1 nanosecond (1 x 10- seconds) to move a word from L1 cache to the registers and 10 nanoseconds to move a word from L2 cache to the registers. Assuming that all of the words that are not in L1 cache are in L2 cache, what is the percentage reduction in the time it takes to get the 1800 words of data into the registers if the hit rate is increased from 96% to 98%? Round your answer to the nearest tenth of a per cent. Hint: start by calculating the time to load the words available from L1 cache plus the time to load those from L2 cache, for each hit rate.
Expert Answer:
Answer rating: 100% (QA)
To solve this problem well first calculate the number of words found in the L1 cache for each hit rate then determine the time it takes to load the wo... View the full answer
Related Book For
Operating Systems Internals and Design Principles
ISBN: 978-0133805918
8th edition
Authors: William Stallings
Posted Date:
Students also viewed these programming questions
-
Explain porters competitive strategies focusing on low cost strategy and differentiation strategy with example.
-
1. Draw a process flow diagram showing the major process steps, inventories, and flows.Indicate the capacity at each of the process steps. You should assume: a. 16,000 barrels per day is the average...
-
To analyze the sequences in Table 3.2 (see the next page), you will use manual methods that were used by geneticists until the development of computer-based methods. However, to make your comparison...
-
Given the following class, which statement is correct? A. The class does not contain any security issues. B. The class contains exactly one security issue. C. The class contains exactly two security...
-
An ac generator supplies an rms voltage of 5.00 V to an RL circuit. At a frequency of 20.0 kHz the rms current in the circuit is 45.0 mA; at a frequency of 25.0 kHz the rms current is 40.0 mA. What...
-
Ignoring taxes in Problem 6, what is the price per share of equity under Plan I? Plan II? What principle is illustrated by your answers?
-
Global Enterprises Corporation (GE) is a manufacturing company whose principal products are microwave ovens, refrigerators, and conventional ovens. The company had a long history of selling...
-
A college student, Austin Keynes, wished to purchase a new entertainment system from Friedman Electronics, Inc. Because Keynes did not have the cash to pay for the entertainment system, he offered to...
-
Question 24 of 40 View Policies Current Attempt in Progress The following information applied to Concord Inc. for 2025: Merchandise purchased for resale Freight-in Freight-out Purchase returns...
-
Harrell and Smith, Inc., 204 Ambulance Street, Anywhere, CA 92345, is a corporation (EIN 57-1234567) formed on January 1, 2010. Information concerning the corporation and its two shareholders...
-
Major Manuscripts, Inc. does not want to incur any additional external financing. The dividend payout ratio is constant. What is the firm's maximum rate of growth?
-
A metal plate of aluminum is exposed an oxygen rich atmosphere on one side and an oxygen deficient atmosphere on the other side, at 500K. Assuming steady-state diffusion has been achieved, calculate...
-
Evaluate 7m+3mn when m = 8 and n = 14
-
Nowater, Inc. completed Job No. H12 during the year. The job cost sheet listed the following: Direct materials Direct labor Manufacturing overhead applied Units produced Units sold $110,000 $60,000...
-
How are advertising and public relations different? A trend within the ad industry is to merge Madison and Vine. What does this mean and how has it changed the face of marketing? We discussed...
-
Find lim x-2x-35 x-5 x+3x-10
-
What is a VOTL vehicle and how could these vehicles transform logistics? What are the implications for global supply chains?
-
If there is an unrealized holding gain on available-for-sale investments, it is reported as?
-
But some existing optimizing compilers (including gcc, which tends to be relatively conservative) will optimize count_positives to something similar to void count_positives(list l) { list p; register...
-
Figure suggests that a process can only be in one event queue at a time. a. Is it possible that you would want to allow a process to wait on more than one event at the same time? Provide an example....
-
Contrast the scheduling policies you might use when trying to optimize a time-sharing system with those you would use to optimize a multi-programmed batch system.
-
Show that the graph whose adjacency matrix is below has no cycles. \[ \left(\begin{array}{lllllllll} 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 &...
-
Prove Theorem 1.
-
Show that there is no four-vertex undirected graph with degrees \(d\left(v_{1} ight)=3, d\left(v_{2} ight)=2, d\left(v_{3} ight)=2\), and \(d\left(v_{4} ight)=2\).
Study smarter with the SolutionInn App