Given: TLB hit=5ns Cache hit =12ns Main memory=25ns (Memory reference) Hard drive=200ms (Disk reference) Hit ratio TLB=90% Hit ratio cache=98% Rate of Page fault=0.001%

Question

Want to see more full solutions like this?

Answer 1

Question

Chapter 6, Problem 23E

a)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

a)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) hit and cache Hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a hit and it indicates that the page number is being mapped with the frame number that is present in the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are present it is meant to be a hit.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+Cache_accesstime=5+12=17ns$

Therefore, the total access time is 17ns.

b)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

b)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table hit and cache Hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is found in the page table, the address of the virtual memory is mapped with the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are present it is meant to be a hit.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Cache_accesstime=5+25+12=42ns$

Therefore, the total access time is 42ns.

c)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

c)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table hit and cache Miss:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is found in the page table, the address of the virtual memory is mapped with the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are not present it is meant to be a miss, then the access is being transferred to main memory and the block that is required is transferred again to the cache.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Cache_accesstime+MainMemory_accesstime=5+25+12+25=67ns$

Therefore, the total access time is 67ns.

d)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

d)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table miss and cache hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is not found in the page table, there occurs a page fault .
- The access is made with the hard drive to bring the required data into the main memory.
There is no possibility of the cache being hit in this scenario because the address is not present in the main memory itself

Therefore, this type of access is not possible.

e)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

e)

Expert Solution

Explanation of Solution

TLB miss and page table miss:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is not found in the page table, there occurs a page fault.
- The access is made with the hard drive to bring the required data into the main memory.
- The access will be getting restarted at this stage.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- Now the request page number is found at the page table of the main memory.
- There occurs a page hit.
- The value that is requested and found in the main memory may not be reflected at the cache.
- There occurs a cache miss.
- Then the main memory is accessed to bring the block to the cache.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Harddrive_accesstime+TLB_access time+Cache_accesstime=5+25+200+5+12=200.047ms$

Therefore, the total access time is $200.047 ms$ .

Effective Access time (EAT):

EAT is a measure of Hierarchal memory performance.
A weighted average that utilizes the hit ratio and the relative access time of the levels present in successful order of the memory hierarchy is called as effective access time.
The actual time of the access is based on the technology that is utilized to access the contents present at each level of the hierarchy.

Formula for the effective access time:

The formula for effective access time where the memory contains two levels that includes a main memory and the cache memory is obtained as shown below:

$EAT = H×Accessc+(1-H)×AccessMM$

In the above formula,

$H = cache hitAccessc = cache access timeAccessMM = Main Memory access time$

Any access that is made is being split up into following ways:

Virtual access
Main memory access

If the contents are present in the TLB then it is called as hit, and if the element is not present in the TLB then the element is accessed at the page table.

If the element is present at the page table then it is a hit, if the contents are not present then the access is made at the main memory to bring the elements to the cache.

Now again the contents are searched at the cache now the data found is considered as a hit.

$EAT = Virtual access + Main Memory accessVirtual access=TLBHit×TLB_accesstime+(1-TLBHit)×PageTable access timeMain Memory access =cachehit×cache_accesstime+(1-cachehitrate)×MainMemory_accesstime$

$Virtual access=0.9×5+(1-0.9)×(0.001×200+0.999×25)Main Memory access =0.98×12+(1-0.98)×25EAT =0.9×5+(1-0.9)×(0.001×200+0.999×25)+0.98×12+(1-0.98)×25$

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Students have asked these similar questions

"Do not use AI tools. Solve the problem by hand on paper only and upload a photo of your handwritten solution."

Specifications: Part-1Part-1: DescriptionIn this part of the lab you will build a single operation ALU. This ALU will implement a bitwise left rotation. Forthis lab assignment you are not allowed to use Digital's Arithmetic components.IF YOU ARE FOUND USING THEM, YOU WILL RECEIVE A ZERO FOR LAB2!The ALU you will be implementing consists of two 4-bit inputs (named inA and inB) and one 4-bit output (named out). Your ALU must rotate the bits in inA by the amount given by inB (i.e. 0-15).Part-1: User InterfaceYou are provided an interface file lab2_part1.dig; start Part-1 from this file.NOTE: You are not permitted to edit the content inside the dotted lines rectangle. Part-1: ExampleIn the figure above, the input values that we have selected to test are inA = {inA_3, inA_2, inA_1, inA_0} = {0, 1, 0,0} and inB = {inB_3, inB_2, inB_1, inB_0} = {0, 0, 1, 0}. Therefore, we must rotate the bus 0100 bitwise left by00102, or 2 in base 10, to get {0, 0, 0, 1}. Please note that a rotation left is…

Solve this "Do not use AI tools. Solve the problem by hand on paper only and upload a photo of your handwritten solution."

Answer 2

Question

Chapter 6, Problem 23E

a)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

a)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) hit and cache Hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a hit and it indicates that the page number is being mapped with the frame number that is present in the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are present it is meant to be a hit.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+Cache_accesstime=5+12=17ns$

Therefore, the total access time is 17ns.

b)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

b)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table hit and cache Hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is found in the page table, the address of the virtual memory is mapped with the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are present it is meant to be a hit.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Cache_accesstime=5+25+12=42ns$

Therefore, the total access time is 42ns.

c)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

c)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table hit and cache Miss:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is found in the page table, the address of the virtual memory is mapped with the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are not present it is meant to be a miss, then the access is being transferred to main memory and the block that is required is transferred again to the cache.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Cache_accesstime+MainMemory_accesstime=5+25+12+25=67ns$

Therefore, the total access time is 67ns.

d)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

d)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table miss and cache hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is not found in the page table, there occurs a page fault .
- The access is made with the hard drive to bring the required data into the main memory.
There is no possibility of the cache being hit in this scenario because the address is not present in the main memory itself

Therefore, this type of access is not possible.

e)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

e)

Expert Solution

Explanation of Solution

TLB miss and page table miss:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is not found in the page table, there occurs a page fault.
- The access is made with the hard drive to bring the required data into the main memory.
- The access will be getting restarted at this stage.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- Now the request page number is found at the page table of the main memory.
- There occurs a page hit.
- The value that is requested and found in the main memory may not be reflected at the cache.
- There occurs a cache miss.
- Then the main memory is accessed to bring the block to the cache.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Harddrive_accesstime+TLB_access time+Cache_accesstime=5+25+200+5+12=200.047ms$

Therefore, the total access time is $200.047 ms$ .

Effective Access time (EAT):

EAT is a measure of Hierarchal memory performance.
A weighted average that utilizes the hit ratio and the relative access time of the levels present in successful order of the memory hierarchy is called as effective access time.
The actual time of the access is based on the technology that is utilized to access the contents present at each level of the hierarchy.

Formula for the effective access time:

The formula for effective access time where the memory contains two levels that includes a main memory and the cache memory is obtained as shown below:

$EAT = H×Accessc+(1-H)×AccessMM$

In the above formula,

$H = cache hitAccessc = cache access timeAccessMM = Main Memory access time$

Any access that is made is being split up into following ways:

Virtual access
Main memory access

If the contents are present in the TLB then it is called as hit, and if the element is not present in the TLB then the element is accessed at the page table.

If the element is present at the page table then it is a hit, if the contents are not present then the access is made at the main memory to bring the elements to the cache.

Now again the contents are searched at the cache now the data found is considered as a hit.

$EAT = Virtual access + Main Memory accessVirtual access=TLBHit×TLB_accesstime+(1-TLBHit)×PageTable access timeMain Memory access =cachehit×cache_accesstime+(1-cachehitrate)×MainMemory_accesstime$

$Virtual access=0.9×5+(1-0.9)×(0.001×200+0.999×25)Main Memory access =0.98×12+(1-0.98)×25EAT =0.9×5+(1-0.9)×(0.001×200+0.999×25)+0.98×12+(1-0.98)×25$

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Answer 3

Question

Chapter 6, Problem 23E

a)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

a)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) hit and cache Hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a hit and it indicates that the page number is being mapped with the frame number that is present in the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are present it is meant to be a hit.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+Cache_accesstime=5+12=17ns$

Therefore, the total access time is 17ns.

b)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

b)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table hit and cache Hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is found in the page table, the address of the virtual memory is mapped with the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are present it is meant to be a hit.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Cache_accesstime=5+25+12=42ns$

Therefore, the total access time is 42ns.

c)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

c)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table hit and cache Miss:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is found in the page table, the address of the virtual memory is mapped with the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are not present it is meant to be a miss, then the access is being transferred to main memory and the block that is required is transferred again to the cache.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Cache_accesstime+MainMemory_accesstime=5+25+12+25=67ns$

Therefore, the total access time is 67ns.

d)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

d)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table miss and cache hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is not found in the page table, there occurs a page fault .
- The access is made with the hard drive to bring the required data into the main memory.
There is no possibility of the cache being hit in this scenario because the address is not present in the main memory itself

Therefore, this type of access is not possible.

e)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

e)

Expert Solution

Explanation of Solution

TLB miss and page table miss:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is not found in the page table, there occurs a page fault.
- The access is made with the hard drive to bring the required data into the main memory.
- The access will be getting restarted at this stage.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- Now the request page number is found at the page table of the main memory.
- There occurs a page hit.
- The value that is requested and found in the main memory may not be reflected at the cache.
- There occurs a cache miss.
- Then the main memory is accessed to bring the block to the cache.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Harddrive_accesstime+TLB_access time+Cache_accesstime=5+25+200+5+12=200.047ms$

Therefore, the total access time is $200.047 ms$ .

Effective Access time (EAT):

EAT is a measure of Hierarchal memory performance.
A weighted average that utilizes the hit ratio and the relative access time of the levels present in successful order of the memory hierarchy is called as effective access time.
The actual time of the access is based on the technology that is utilized to access the contents present at each level of the hierarchy.

Formula for the effective access time:

The formula for effective access time where the memory contains two levels that includes a main memory and the cache memory is obtained as shown below:

$EAT = H×Accessc+(1-H)×AccessMM$

In the above formula,

$H = cache hitAccessc = cache access timeAccessMM = Main Memory access time$

Any access that is made is being split up into following ways:

Virtual access
Main memory access

If the contents are present in the TLB then it is called as hit, and if the element is not present in the TLB then the element is accessed at the page table.

If the element is present at the page table then it is a hit, if the contents are not present then the access is made at the main memory to bring the elements to the cache.

Now again the contents are searched at the cache now the data found is considered as a hit.

$EAT = Virtual access + Main Memory accessVirtual access=TLBHit×TLB_accesstime+(1-TLBHit)×PageTable access timeMain Memory access =cachehit×cache_accesstime+(1-cachehitrate)×MainMemory_accesstime$

$Virtual access=0.9×5+(1-0.9)×(0.001×200+0.999×25)Main Memory access =0.98×12+(1-0.98)×25EAT =0.9×5+(1-0.9)×(0.001×200+0.999×25)+0.98×12+(1-0.98)×25$

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Answer 4

Question

Chapter 6, Problem 23E

a)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

a)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) hit and cache Hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a hit and it indicates that the page number is being mapped with the frame number that is present in the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are present it is meant to be a hit.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+Cache_accesstime=5+12=17ns$

Therefore, the total access time is 17ns.

b)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

b)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table hit and cache Hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is found in the page table, the address of the virtual memory is mapped with the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are present it is meant to be a hit.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Cache_accesstime=5+25+12=42ns$

Therefore, the total access time is 42ns.

c)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

c)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table hit and cache Miss:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is found in the page table, the address of the virtual memory is mapped with the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are not present it is meant to be a miss, then the access is being transferred to main memory and the block that is required is transferred again to the cache.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Cache_accesstime+MainMemory_accesstime=5+25+12+25=67ns$

Therefore, the total access time is 67ns.

d)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

d)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table miss and cache hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is not found in the page table, there occurs a page fault .
- The access is made with the hard drive to bring the required data into the main memory.
There is no possibility of the cache being hit in this scenario because the address is not present in the main memory itself

Therefore, this type of access is not possible.

e)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

e)

Expert Solution

Explanation of Solution

TLB miss and page table miss:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is not found in the page table, there occurs a page fault.
- The access is made with the hard drive to bring the required data into the main memory.
- The access will be getting restarted at this stage.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- Now the request page number is found at the page table of the main memory.
- There occurs a page hit.
- The value that is requested and found in the main memory may not be reflected at the cache.
- There occurs a cache miss.
- Then the main memory is accessed to bring the block to the cache.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Harddrive_accesstime+TLB_access time+Cache_accesstime=5+25+200+5+12=200.047ms$

Therefore, the total access time is $200.047 ms$ .

Effective Access time (EAT):

EAT is a measure of Hierarchal memory performance.
A weighted average that utilizes the hit ratio and the relative access time of the levels present in successful order of the memory hierarchy is called as effective access time.
The actual time of the access is based on the technology that is utilized to access the contents present at each level of the hierarchy.

Formula for the effective access time:

The formula for effective access time where the memory contains two levels that includes a main memory and the cache memory is obtained as shown below:

$EAT = H×Accessc+(1-H)×AccessMM$

In the above formula,

$H = cache hitAccessc = cache access timeAccessMM = Main Memory access time$

Any access that is made is being split up into following ways:

Virtual access
Main memory access

If the contents are present in the TLB then it is called as hit, and if the element is not present in the TLB then the element is accessed at the page table.

If the element is present at the page table then it is a hit, if the contents are not present then the access is made at the main memory to bring the elements to the cache.

Now again the contents are searched at the cache now the data found is considered as a hit.

$EAT = Virtual access + Main Memory accessVirtual access=TLBHit×TLB_accesstime+(1-TLBHit)×PageTable access timeMain Memory access =cachehit×cache_accesstime+(1-cachehitrate)×MainMemory_accesstime$

$Virtual access=0.9×5+(1-0.9)×(0.001×200+0.999×25)Main Memory access =0.98×12+(1-0.98)×25EAT =0.9×5+(1-0.9)×(0.001×200+0.999×25)+0.98×12+(1-0.98)×25$

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Answer 5

Chapter 6, Problem 23E

a)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

a)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) hit and cache Hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a hit and it indicates that the page number is being mapped with the frame number that is present in the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are present it is meant to be a hit.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+Cache_accesstime=5+12=17ns$

Therefore, the total access time is 17ns.

b)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

b)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table hit and cache Hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is found in the page table, the address of the virtual memory is mapped with the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are present it is meant to be a hit.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Cache_accesstime=5+25+12=42ns$

Therefore, the total access time is 42ns.

c)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

c)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table hit and cache Miss:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is found in the page table, the address of the virtual memory is mapped with the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are not present it is meant to be a miss, then the access is being transferred to main memory and the block that is required is transferred again to the cache.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Cache_accesstime+MainMemory_accesstime=5+25+12+25=67ns$

Therefore, the total access time is 67ns.

d)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

d)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table miss and cache hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is not found in the page table, there occurs a page fault .
- The access is made with the hard drive to bring the required data into the main memory.
There is no possibility of the cache being hit in this scenario because the address is not present in the main memory itself

Therefore, this type of access is not possible.

e)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

e)

Expert Solution

Explanation of Solution

TLB miss and page table miss:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is not found in the page table, there occurs a page fault.
- The access is made with the hard drive to bring the required data into the main memory.
- The access will be getting restarted at this stage.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- Now the request page number is found at the page table of the main memory.
- There occurs a page hit.
- The value that is requested and found in the main memory may not be reflected at the cache.
- There occurs a cache miss.
- Then the main memory is accessed to bring the block to the cache.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Harddrive_accesstime+TLB_access time+Cache_accesstime=5+25+200+5+12=200.047ms$

Therefore, the total access time is $200.047 ms$ .

Effective Access time (EAT):

EAT is a measure of Hierarchal memory performance.
A weighted average that utilizes the hit ratio and the relative access time of the levels present in successful order of the memory hierarchy is called as effective access time.
The actual time of the access is based on the technology that is utilized to access the contents present at each level of the hierarchy.

Formula for the effective access time:

The formula for effective access time where the memory contains two levels that includes a main memory and the cache memory is obtained as shown below:

$EAT = H×Accessc+(1-H)×AccessMM$

In the above formula,

$H = cache hitAccessc = cache access timeAccessMM = Main Memory access time$

Any access that is made is being split up into following ways:

Virtual access
Main memory access

If the contents are present in the TLB then it is called as hit, and if the element is not present in the TLB then the element is accessed at the page table.

If the element is present at the page table then it is a hit, if the contents are not present then the access is made at the main memory to bring the elements to the cache.

Now again the contents are searched at the cache now the data found is considered as a hit.

$EAT = Virtual access + Main Memory accessVirtual access=TLBHit×TLB_accesstime+(1-TLBHit)×PageTable access timeMain Memory access =cachehit×cache_accesstime+(1-cachehitrate)×MainMemory_accesstime$

$Virtual access=0.9×5+(1-0.9)×(0.001×200+0.999×25)Main Memory access =0.98×12+(1-0.98)×25EAT =0.9×5+(1-0.9)×(0.001×200+0.999×25)+0.98×12+(1-0.98)×25$

Answer 6

Chapter 6, Problem 23E

a)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

a)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) hit and cache Hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a hit and it indicates that the page number is being mapped with the frame number that is present in the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are present it is meant to be a hit.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+Cache_accesstime=5+12=17ns$

Therefore, the total access time is 17ns.

Answer 7

Chapter 6, Problem 23E

a)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

Answer 8

a)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) hit and cache Hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a hit and it indicates that the page number is being mapped with the frame number that is present in the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are present it is meant to be a hit.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+Cache_accesstime=5+12=17ns$

Therefore, the total access time is 17ns.

Answer 9

a)

Expert Solution

Answer 10

a)

Expert Solution

Answer 11

Expert Solution

Answer 12

b)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

b)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table hit and cache Hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is found in the page table, the address of the virtual memory is mapped with the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are present it is meant to be a hit.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Cache_accesstime=5+25+12=42ns$

Therefore, the total access time is 42ns.

Answer 13

b)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

Answer 14

b)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table hit and cache Hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is found in the page table, the address of the virtual memory is mapped with the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are present it is meant to be a hit.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Cache_accesstime=5+25+12=42ns$

Therefore, the total access time is 42ns.

Answer 15

b)

Expert Solution

Answer 16

b)

Expert Solution

Answer 17

Expert Solution

Answer 18

c)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

c)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table hit and cache Miss:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is found in the page table, the address of the virtual memory is mapped with the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are not present it is meant to be a miss, then the access is being transferred to main memory and the block that is required is transferred again to the cache.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Cache_accesstime+MainMemory_accesstime=5+25+12+25=67ns$

Therefore, the total access time is 67ns.

Answer 19

c)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

Answer 20

c)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table hit and cache Miss:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is found in the page table, the address of the virtual memory is mapped with the main memory.
The contents of the cache will also be accessed to find whether the data is present in the cache as well and if the same contents are not present it is meant to be a miss, then the access is being transferred to main memory and the block that is required is transferred again to the cache.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Cache_accesstime+MainMemory_accesstime=5+25+12+25=67ns$

Therefore, the total access time is 67ns.

Answer 21

c)

Expert Solution

Answer 22

c)

Expert Solution

Answer 23

Expert Solution

Answer 24

d)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

d)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table miss and cache hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is not found in the page table, there occurs a page fault .
- The access is made with the hard drive to bring the required data into the main memory.
There is no possibility of the cache being hit in this scenario because the address is not present in the main memory itself

Therefore, this type of access is not possible.

Answer 25

d)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

Answer 26

d)

Expert Solution

Explanation of Solution

TLB (Translation Look aside Buffer) miss, page table miss and cache hit:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is not found in the page table, there occurs a page fault .
- The access is made with the hard drive to bring the required data into the main memory.
There is no possibility of the cache being hit in this scenario because the address is not present in the main memory itself

Therefore, this type of access is not possible.

Answer 27

d)

Expert Solution

Answer 28

d)

Expert Solution

Answer 29

Expert Solution

Answer 30

e)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

e)

Expert Solution

Explanation of Solution

TLB miss and page table miss:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is not found in the page table, there occurs a page fault.
- The access is made with the hard drive to bring the required data into the main memory.
- The access will be getting restarted at this stage.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- Now the request page number is found at the page table of the main memory.
- There occurs a page hit.
- The value that is requested and found in the main memory may not be reflected at the cache.
- There occurs a cache miss.
- Then the main memory is accessed to bring the block to the cache.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Harddrive_accesstime+TLB_access time+Cache_accesstime=5+25+200+5+12=200.047ms$

Therefore, the total access time is $200.047 ms$ .

Effective Access time (EAT):

EAT is a measure of Hierarchal memory performance.
A weighted average that utilizes the hit ratio and the relative access time of the levels present in successful order of the memory hierarchy is called as effective access time.
The actual time of the access is based on the technology that is utilized to access the contents present at each level of the hierarchy.

Formula for the effective access time:

The formula for effective access time where the memory contains two levels that includes a main memory and the cache memory is obtained as shown below:

$EAT = H×Accessc+(1-H)×AccessMM$

In the above formula,

$H = cache hitAccessc = cache access timeAccessMM = Main Memory access time$

Any access that is made is being split up into following ways:

Virtual access
Main memory access

If the contents are present in the TLB then it is called as hit, and if the element is not present in the TLB then the element is accessed at the page table.

If the element is present at the page table then it is a hit, if the contents are not present then the access is made at the main memory to bring the elements to the cache.

Now again the contents are searched at the cache now the data found is considered as a hit.

$EAT = Virtual access + Main Memory accessVirtual access=TLBHit×TLB_accesstime+(1-TLBHit)×PageTable access timeMain Memory access =cachehit×cache_accesstime+(1-cachehitrate)×MainMemory_accesstime$

$Virtual access=0.9×5+(1-0.9)×(0.001×200+0.999×25)Main Memory access =0.98×12+(1-0.98)×25EAT =0.9×5+(1-0.9)×(0.001×200+0.999×25)+0.98×12+(1-0.98)×25$

Answer 31

e)

Program Plan Intro

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

Answer 32

e)

Expert Solution

Explanation of Solution

TLB miss and page table miss:

Translation Look aside buffer is special type of cache that is used to store the contents of the page table.
The content of the TLB cache includes pairs of virtual page number, physical frame numbers.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- If the page entry is not found in the page table, there occurs a page fault.
- The access is made with the hard drive to bring the required data into the main memory.
- The access will be getting restarted at this stage.
The page number that is required can be looked up inside the TLB.
- If the requested page number is found it is considered to be a miss, then the page number that is required is searched in the main memory’s page table.
- Now the request page number is found at the page table of the main memory.
- There occurs a page hit.
- The value that is requested and found in the main memory may not be reflected at the cache.
- There occurs a cache miss.
- Then the main memory is accessed to bring the block to the cache.

Therefore, this type of access is possible and the total access time is calculated as shown below:

$Access Time = TLB_access time+MainMemory_accesstime+Harddrive_accesstime+TLB_access time+Cache_accesstime=5+25+200+5+12=200.047ms$

Therefore, the total access time is $200.047 ms$ .

Effective Access time (EAT):

EAT is a measure of Hierarchal memory performance.
A weighted average that utilizes the hit ratio and the relative access time of the levels present in successful order of the memory hierarchy is called as effective access time.
The actual time of the access is based on the technology that is utilized to access the contents present at each level of the hierarchy.

Formula for the effective access time:

The formula for effective access time where the memory contains two levels that includes a main memory and the cache memory is obtained as shown below:

$EAT = H×Accessc+(1-H)×AccessMM$

In the above formula,

$H = cache hitAccessc = cache access timeAccessMM = Main Memory access time$

Any access that is made is being split up into following ways:

Virtual access
Main memory access

If the contents are present in the TLB then it is called as hit, and if the element is not present in the TLB then the element is accessed at the page table.

If the element is present at the page table then it is a hit, if the contents are not present then the access is made at the main memory to bring the elements to the cache.

Now again the contents are searched at the cache now the data found is considered as a hit.

$EAT = Virtual access + Main Memory accessVirtual access=TLBHit×TLB_accesstime+(1-TLBHit)×PageTable access timeMain Memory access =cachehit×cache_accesstime+(1-cachehitrate)×MainMemory_accesstime$

$Virtual access=0.9×5+(1-0.9)×(0.001×200+0.999×25)Main Memory access =0.98×12+(1-0.98)×25EAT =0.9×5+(1-0.9)×(0.001×200+0.999×25)+0.98×12+(1-0.98)×25$

Answer 33

e)

Expert Solution

Answer 34

e)

Expert Solution

Answer 35

Expert Solution

Answer 36

Ch. 6 - Prob. 1RETC Ch. 6 - Prob. 2RETC Ch. 6 - Prob. 3RETC Ch. 6 - Prob. 4RETC Ch. 6 - Prob. 5RETC Ch. 6 - Prob. 6RETC Ch. 6 - Prob. 7RETC Ch. 6 - Prob. 8RETC Ch. 6 - Prob. 9RETC Ch. 6 - Prob. 10RETC

Given: TLB hit=5ns Cache hit =12ns Main memory=25ns (Memory reference) Hard drive=200ms (Disk reference) Hit ratio TLB=90% Hit ratio cache=98% Rate of Page fault=0.001%

Videos

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

Explanation of Solution

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

Explanation of Solution

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

Explanation of Solution

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

Explanation of Solution

Given:

TLB hit=5ns

Cache hit =12ns

Main memory=25ns (Memory reference)

Hard drive=200ms (Disk reference)

Hit ratio TLB=90%

Hit ratio cache=98%

Rate of Page fault=0.001%

Explanation of Solution

Want to see more full solutions like this?

Chapter 6 Solutions