Assume that there are two types of memories: the smaller, more expensive, faster memories and the larger, cheaper, slower memories. Suppose the processor has access to these two levels of memory. If the word that is being accessed is found in the faster memory, the processor directly accesses it, and this is known as a hit. If the word is in the slower memory, the word is first transferred into the faster memory and then accessed by the processor. The latter is known as a miss. In the scenario above, calculate the average time to access a word, given: T1 (time to access faster memory) = 0.1µs T2 (time to access slower memory) = 1µs The time to transfer data between the slower and faster memories can be ignored Hit rate (probability of finding a given word in the faster memory) = 95%
Assume that there are two types of memories: the smaller, more expensive, faster memories and the larger, cheaper, slower memories. Suppose the processor has access to these two levels of memory. If the word that is being accessed is found in the faster memory, the processor directly accesses it, and this is known as a hit. If the word is in the slower memory, the word is first transferred into the faster memory and then accessed by the processor. The latter is known as a miss. In the scenario above, calculate the average time to access a word, given: T1 (time to access faster memory) = 0.1µs T2 (time to access slower memory) = 1µs The time to transfer data between the slower and faster memories can be ignored Hit rate (probability of finding a given word in the faster memory) = 95%
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
In the scenario above, calculate the average time to access a word, given.
![Assume that there are two types of memories: the smaller, more expensive, faster memories and
the larger, cheaper, slower memories. Suppose the processor has access to these two levels of
memory. If the word that is being accessed is found in the faster memory, the processor directly
accesses it, and this is known as a hit. If the word is in the slower memory, the word is first
transferred into the faster memory and then accessed by the processor. The latter is known as a
miss.
In the scenario above, calculate the average time to access a word, given:
T1 (time to access faster memory) = 0.1µs
T2 (time to access slower memory) = 1µs
The time to transfer data between the slower and faster memories can be ignored
Hit rate (probability of finding a given word in the faster memory) = 95%](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ff90e9f76-a8ee-4e86-857e-4cb9f0bb2381%2F162b0fd3-52ae-4366-92e3-eab916ed671d%2F3asj4ks_processed.png&w=3840&q=75)
Transcribed Image Text:Assume that there are two types of memories: the smaller, more expensive, faster memories and
the larger, cheaper, slower memories. Suppose the processor has access to these two levels of
memory. If the word that is being accessed is found in the faster memory, the processor directly
accesses it, and this is known as a hit. If the word is in the slower memory, the word is first
transferred into the faster memory and then accessed by the processor. The latter is known as a
miss.
In the scenario above, calculate the average time to access a word, given:
T1 (time to access faster memory) = 0.1µs
T2 (time to access slower memory) = 1µs
The time to transfer data between the slower and faster memories can be ignored
Hit rate (probability of finding a given word in the faster memory) = 95%
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education