3. (20p)A computer has a cache, main memory, and a disk used for virtual memory. If a referenced word is in the cache, 1 ns are required to access it. If it is in main memory but not in the cache, 10 ns are needed to load it into the cache, and then the reference is started again. If the word is not in main memory, 100 ns are required to fetch the word from disk, followed by 10 ns to copy it to the cache, and then the reference is started again. The cache hit ratio is 0.9 and the main memory hit ratio is 0.8. What is the average time in nanoseconds required to access a referenced word on this system?

3. (20p)A computer has a cache, main memory, and a disk used for virtual memory. If a referenced word is in the cache, 1 ns are required to access it. If it is in main memory but not in the cache, 10 ns are needed to load it into the cache, and then the reference is started again. If the word is not in main memory, 100 ns are required to fetch the word from disk, followed by 10 ns to copy it to the cache, and then the reference is started again. The cache hit ratio is 0.9 and the main memory hit ratio is 0.8. What is the average time in nanoseconds required to access a referenced word on this system?

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

See similar textbooks

Similar questions

Done can ontung mane hange he as of anguages thataapt we sae at wun oowng r O The moste TM cannot shn te the t ata-amernans statonay, or ineves one stp to e rght The udted Tast te t dty te g at teape The e is t dret.ater han jat the rge O Baundng hedte
I am not feeling okay, please help me do my assignment I have attached the image kindly solve it I will be thankfull to you forever <3
Artificial Inteligence
turing machine
According to legend, the first century Jewish historian, Flavius Josephus,was captured along with a band of 40 compatriots by Roman soldiers duringthe Jewish–Roman war. The captured soldiers decided that they preferredsuicide to being captured and devised a plan for their demise. They wereto form a circle and kill every third soldier until they were all dead. Josephand one other decided they wanted no part of this and quickly calculatedwhere they needed to place themselves in the circle so that they would bothsurvive. Write a program that allows you to place n people in a circle andspecify that every m person will be killed. The program should determinethe number of the last person left in the circle. Use a circularly linked listto solve the problem.
Plz asap
Computer Science
Explaination..........
Please solve max 30 minutes thank u Boolean Satisfaction Problem Boolean Satisfiability Problem (SAT) (https://en.wikipedia.org/wiki/Boolean_satisfiability_problem) is one of the most important problems in Computer Science. SAT is a problem that has NP-Complete complexity, where the only way to solve the problem is to try all the possibilities and check which one is correct. [LO 1, LO 2, LO 3 & LO 4,] Briefly explain how you use Strongly Connected Component (SCC) to solve the special case of the Boolean Satisfiability Problem, namely 2-SAT (https://en.wikipedia. org/wiki/2-SAT) . This solution has linear complexity. NOTE LO1: Explain fundamental concept of analysis arithms. LO2: Apply algorithm techniques and methods. LO3: Solve a problem using specific algorithm. LO4: Compare several algorithm design methods
I need the answer as soon as possible
Gregor Clegane donates his jousting prize money to charities. He is donating 30 Gold Dragons and has three charities in mind. In how many ways can he split his winnings between the three charities? A. 465 B. 496 C. 4060 D. 24360
subject :AI Write a hill climbing algorithm to solve gps problem