Computers and Technology

Assume that the execution time for a program is directly proportional to instruction access time. The access to an instruction in the cache is 10 times faster than access to an instruction in the main memory. If an instruction is not found in the cache, i. e., cache miss, it is fetched from the main memory to the cache and then fetched from the cache to be executed. Assume that a requested instruction will cause cache miss has a probability of 0.08. Let the speedup factor is defined as the ratio of program execution time without the cache to program execution time with the cache. a. Calculate the speedup factor to execute such a program.
b. using this assumption, assuming that the cache is 20 times faster than the main memory.

answer
Answers: 3

Other questions on the subject: Computers and Technology

image
Computers and Technology, 22.06.2019 19:10, hgdthbgjnb83661
What a backup plan that you have created in a event you encounter a situation
Answers: 2
image
Computers and Technology, 23.06.2019 03:30, patience233
Many everyday occurrences can be represented as a binary bit. for example, a door is open or closed, the stove is on or off, and the fog is asleep or awake. could relationships be represented as a binary value? give example.
Answers: 1
image
Computers and Technology, 23.06.2019 13:00, dimondqueen511
Which one of the following voltages should never be measured directly with a vom? a. 1200 v b. 500 v c. 800 v d. 100v
Answers: 2
image
Computers and Technology, 23.06.2019 13:30, alannaamarriee
Jace needs to answer a question on square roots to win a quiz. how can he use a spreadsheet to find the square root of 786? a. use the functions round and count b. create a table and chart c. use the function sqrt d. use the function now
Answers: 3
Do you know the correct answer?
Assume that the execution time for a program is directly proportional to instruction access time. Th...

Questions in other subjects:

Konu
SAT, 11.05.2021 03:00
Konu
Social Studies, 11.05.2021 03:00
Konu
Mathematics, 11.05.2021 03:00