Homework Answers
1. It’s possible to get: TLB hit/ Cache miss. ------- True (T)
2. It’s possible to get: TLB miss/ Page Table hit/ Cache hit. ------ True (T)
3. It’s possible to get: TLB miss/ Page Table hit/ Cache miss. ------ True (T)
4. It’s possible to get: TLB miss/ Page Fault/ Cache hit. ------ False (F)
Explanation:
1. It’s possible to get: TLB hit/ Cache miss. ------- True (T)
Reason: If page is present in TLB, means if TLB is hit then nothing is checked. (page table should be hit in this case, if page table misses then this combination is also impossible)
2. It’s possible to get: TLB miss/ Page Table hit/ Cache hit. ------ True (T)
Reason: If TLB misses, page can be found in page table.
3. It’s possible to get: TLB miss/ Page Table hit/ Cache miss. ------ True (T)
Reason: if page is not present in TLB, page can be found in page table but it is not necessary that data should be available in cache.
4. It’s possible to get: TLB miss/ Page Fault/ Cache hit. ------ False (F)
Reason: Page fault means page is not present main memory, if page is not in memory, then how can it be inside a cache, Impossible.
Add Answer to:
Computer
architecture
Question 25 Answer the following about the memory system with virtual memory. Select True/False...
Question 31 supus Given a computer using a byte-addressable virtual memory system with a two-entry TLB,...
Question 31 supus Given a computer using a byte-addressable virtual memory system with a two-entry TLB, a 2-way set associative cache, and a page table for a process P. Assume cache blocks of size 16 bytes. Assume pages of size 32 bytes and a main memory of 4 frames. Assume the following TLB and page table for Process P: TLB 03 4 هما 0 1 2 3 4 5 6 7 Page Table f Vali d 1 1 0 2...
7 pts Question 30 Consider a computer system that uses virtual memory with paging with a...
7 pts Question 30 Consider a computer system that uses virtual memory with paging with a TLB. Suppose main memory access time is 10 ns and the time to look up the TLB 1 ns. Assume no page faults and the TLB has a hit of 95%. What is the effective memory access time (express in ns) 11ns
Computer Organization and Design, Risc-V Mips Question 9 8 pts Complete the following trace of accesses to virtual addre...
Computer Organization and Design, Risc-V Mips
Question 9 8 pts Complete the following trace of accesses to virtual addresses. In the case of page faults, continue allocating physical pages in the order Ox10000, 0x10001, Ox10002, etc. Page Physical Virtual Virtual TLB TLB PT Physical address page num hit/miss entry index fault page num address Ох00002040| Ох00002 Ox00011040 hit 2 Ox00011 OX000067CC Ox00006 Ox00080 0X000807CC miss 6 O no Ox00003008 Ox00003 Ох10000 miss 3 Ох10000008 1 yes Ox00005958 OX0000300C Ox00001080 OX00007F68...
Question 30 7 pts Consider a computer system that uses virtual memory with paging with a...
Question 30 7 pts Consider a computer system that uses virtual memory with paging with a TUB. Suppose main memory access time is 10 ns and the time to look up the TLB 1 ns. Assume no page faults and the TLB has a hit of 95%. What is the effective memory access time (express in ns)
Computer architecture rence1 (Choone) D Question 21 Regarding the virtual memory system, check all the statements...
Computer
architecture
rence1 (Choone) D Question 21 Regarding the virtual memory system, check all the statements that are true. Each program has its own page table, A program's memory space must be a contiguous physical addresses in the RAM, The user program is responsible for maintaining its own page table, If a computer has 1 GB RAM, the software can be written to use 2 GB of memory. It enables multiple programs to share the computer's memory, each program can...
As described in 5.7, virtual memory uses a page table to track the mapping of virtual...
As described in 5.7, virtual memory uses a page table to track the mapping of virtual addresses to the physical addresses. This exercise shows how this table must be updated as addresses are accessed. The following data constitutes a stream of virtual addresses as seen on a system. Assume 4 KiB pages, a 4-entry fully associative TLB, and true LRU replacement. If pages must be brought in from disk, increment the next largest page number. 4669, 2227, 13916, 34587, 48870,...
Each of the following questions is either True or False. Place a T (True) if the...
Each of the following questions is either True or False. Place a T (True) if the answer is True on the answer sheet beside the question; otherwise place a F (False) if the answer is False on the answer sheet beside the question. 21. Variable-length instructions are easier to decode than fixed-length instructions. T F 22. Fixed-length instructions always have the same number of operands. T F 23. The two types of cache write policies are write-through and write-back. T F 24. When...
Consider the following system: Byte addressable 16-bit addresses 256B pages Single level Page Table System The...
Consider the following system: Byte addressable 16-bit addresses 256B pages Single level Page Table System The system utilizes a fully-associative TLB with 4 entries and an LRU replacement policy. Given the access pattern and timings below, complete the following table. Assume the TLB begins initially empty and the cache is physically addressed NOTE: Access times are not inclusive and components are accessed sequentially. Time to update the TLB is negligible, everything else that needs to be updated will require a...
2. A computer uses virtual memory implemented by paging. The TLB lookup takes 150 ns and...
2. A computer uses virtual memory implemented by paging. The TLB lookup takes 150 ns and the update takes 300 ns. The PT lookup takes 2 us and the update takes 4 us. Loading a word from main memory onto the CPU takes 25 us and loading a page from the disk into main memory takes 20 ms. The TLB hit ratio is 0.3 and the main memory hit ratio is 0.4. Compute the average access time for a referenced...
please answer $5 UXIF map in the computer uses direct mapping Question 18 5 pts Suppose...
please answer
$5 UXIF map in the computer uses direct mapping Question 18 5 pts Suppose we have a byte-addressable computer using 2-way set associative mapping with 16-bit main memory addresses and 32 blocks of cache. Suppose also that each block contains 8 bytes. The size of the block offset field is bits, the bits. size of the set field is bits, and the size of the tag field is 5 pts Question 19 Suppose we have a byte-addressable computer...
Question 31 supus Given a computer using a byte-addressable virtual memory system with a two-entry TLB, a 2-way set associative cache, and a page table for a process P. Assume cache blocks of size 16 bytes. Assume pages of size 32 bytes and a main memory of 4 frames. Assume the following TLB and page table for Process P: TLB 03 4 هما 0 1 2 3 4 5 6 7 Page Table f Vali d 1 1 0 2...
7 pts Question 30 Consider a computer system that uses virtual memory with paging with a TLB. Suppose main memory access time is 10 ns and the time to look up the TLB 1 ns. Assume no page faults and the TLB has a hit of 95%. What is the effective memory access time (express in ns) 11ns
Computer Organization and Design, Risc-V Mips
Question 9 8 pts Complete the following trace of accesses to virtual addresses. In the case of page faults, continue allocating physical pages in the order Ox10000, 0x10001, Ox10002, etc. Page Physical Virtual Virtual TLB TLB PT Physical address page num hit/miss entry index fault page num address Ох00002040| Ох00002 Ox00011040 hit 2 Ox00011 OX000067CC Ox00006 Ox00080 0X000807CC miss 6 O no Ox00003008 Ox00003 Ох10000 miss 3 Ох10000008 1 yes Ox00005958 OX0000300C Ox00001080 OX00007F68...
Question 30 7 pts Consider a computer system that uses virtual memory with paging with a TUB. Suppose main memory access time is 10 ns and the time to look up the TLB 1 ns. Assume no page faults and the TLB has a hit of 95%. What is the effective memory access time (express in ns)
Computer
architecture
rence1 (Choone) D Question 21 Regarding the virtual memory system, check all the statements that are true. Each program has its own page table, A program's memory space must be a contiguous physical addresses in the RAM, The user program is responsible for maintaining its own page table, If a computer has 1 GB RAM, the software can be written to use 2 GB of memory. It enables multiple programs to share the computer's memory, each program can...
As described in 5.7, virtual memory uses a page table to track the mapping of virtual addresses to the physical addresses. This exercise shows how this table must be updated as addresses are accessed. The following data constitutes a stream of virtual addresses as seen on a system. Assume 4 KiB pages, a 4-entry fully associative TLB, and true LRU replacement. If pages must be brought in from disk, increment the next largest page number. 4669, 2227, 13916, 34587, 48870,...
Consider the following system: Byte addressable 16-bit addresses 256B pages Single level Page Table System The system utilizes a fully-associative TLB with 4 entries and an LRU replacement policy. Given the access pattern and timings below, complete the following table. Assume the TLB begins initially empty and the cache is physically addressed NOTE: Access times are not inclusive and components are accessed sequentially. Time to update the TLB is negligible, everything else that needs to be updated will require a...
2. A computer uses virtual memory implemented by paging. The TLB lookup takes 150 ns and the update takes 300 ns. The PT lookup takes 2 us and the update takes 4 us. Loading a word from main memory onto the CPU takes 25 us and loading a page from the disk into main memory takes 20 ms. The TLB hit ratio is 0.3 and the main memory hit ratio is 0.4. Compute the average access time for a referenced...
please answer
$5 UXIF map in the computer uses direct mapping Question 18 5 pts Suppose we have a byte-addressable computer using 2-way set associative mapping with 16-bit main memory addresses and 32 blocks of cache. Suppose also that each block contains 8 bytes. The size of the block offset field is bits, the bits. size of the set field is bits, and the size of the tag field is 5 pts Question 19 Suppose we have a byte-addressable computer...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago