Question: Consider a single-level cache with an access time of 2.5 ns, a line size of 64 bytes, and a hit ratio of H = 0.95.

Consider a single-level cache with an access time of 2.5 ns, a line size of 64 bytes, and a hit ratio of H = 0.95. Main memory uses a block transfer capability that has a first-word (4 bytes) access time of 50 ns and an access time of 5 ns for each word thereafter.
a. What is the access time when there is a cache miss? Assume that the cache waits until the line has been fetched from main memory and then re-executes for a hit.
b. Suppose that increasing the line size to 128 bytes increases the H to 0.97. Does this reduce the average memory access time?

Step by Step Solution

★★★★★

3.53 Rating (160 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock

a First 25 ns are needed to determine that a cache mi... View full answer

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Document Format (1 attachment)

896-C-S-S-A-D (2364).docx

120 KBs Word File

Students Have Also Explored These Related Systems Analysis And Design Questions!

a. Consider an L1 cache with an access time of 1 ns and a hit ratio of H = 0.95. Suppose that we can change the cache design (size of cache, cache organization) such that we increase H to 0.97, but...

Consider again Example 4.3. How does the answer change if the main memory uses a block transfer capability that has a first-word access time of 30 ns and an access time of 5 ns for each word...

Caches are important to providing a high-performance memory hierarchy to processors. Below is a list of 32-bit memory address references, given as word addresses. 3, 180, 43, 2, 191, 88, 190, 14,...

Consider a single-level cache with an access time of 2 ns, a line size of 64 bytes, and a hit ratio H = 0.94. Main memory uses a block transfer capability that has a first-word (4 bytes) access time...

. Consider a single - level cache with an access time of 2 . 5 ns , a block size of 6 4 bytes, and a hit ratio of Main memory uses a block transfer capability that has a first - word ( 4 bytes )...

Consider a single-level cache with an access time of 5 ns, a block size of 128 bytes and a hit ratio H = 0.95. Main memory uses a block transfer capability that CSC 295 Homework 2 Page 1 of 3 has a...

X=3 Y=2 Z=2 Question 3 (a) (b) A 32-bit microprocessor is designed with 32-bit instructions composing of two fields: an opcode and a 3-byte immediate operand or an operand address. The engineer would...

Problem 1 : Suppose a computer system has a cache memory that takes 2 0 nanoseconds ( ns ) to access and a main memory that takes 8 0 ns to access. If the hit ratio for this cache is 0 . 9 , what is...

6. A system has a main memory with a cache plus a disk for virtual memory. The cache access time is 20nsec and the hit ratio for the cache is 90%. If the data being referenced is not in the cache,...

Operation of Two-Level Memory The locality property can be exploited in the formation of a two-level memory. The upper-level memory (M1) is smaller, faster, and more expensive (per bit) than the...

Describe the motion of a particle with position (x, y) as t varies in the given interval. a. x = 3 + 2 cost, y = 1 + 2 sin t, /2 t 3 /2. b. x = 5 sin t, y= 2 cos t, - t 5

The path of a diver is given by 16 +10 where y is the height (in feet) and x is the horizontal distance from the end of the diving board (in feet). (Sen figure Ue the trace or mamu ufsgraphing...

Cost comparisons between the results of actual managerial decisions and those produced by solving decision rule models are typically made by running both sets of decisions through the cost model and...

When planning risk management activities with the key stakeholders, how can the project educate the stakeholders on risk management to foster engagement? A. Provide project management training B....

List and briefly define three file allocation methods.

Define: B = block size R = record size P = size of block pointer F = blocking factor; expected number of records within a block Give a formula for F for the three blocking methods depicted in Figure....

An alternative algorithm for insertion into a B-tree is the following: As the insertion algorithm travels down the tree, each full node that is encountered is immediately split, even though it may...

Goodwin Technologies, a relatively young company, has been wildly successful but has yet to pay a dividend. An analyst forecasts that Goodwin is likely to pay its first dividend three years from now....

Assume that a 3 -year Treasury security yields 4.50%. Also assume that the real risk-free rate (r) is 0.75%, and inflation is expected to be 2.25% annually for the next 3 years. In addition to...

Question 1 0 ( 1 point ) You have been asked to forecast Orwell's additional funds needed ( AFN ) for next year. Assuming the firm is operating at only 5 0 % of capacity and using the data in the...