a computer system has a 1KB page size and keeps the page table for each process...
a computer system has a 1KB page size and keeps the page table for each process in main memory. Because the page table entries are usually cached on chip the average overhead for doing a full page table lookup is 40 ns. To reduce this overhead the computer has a 32 entry TLB. A TLB looup reqiures 1 ns . what TLB hit rate is reqiured to ensure an average virtual address translation time of 2 ns?
Homework Answers
Solution :
if you have any doubts, you
can ask in comment section.
Add Answer to:
a computer system has a 1KB page size and keeps the page table
for each process...
A computer uses virtual memory implemented by paging. The TLB lookup takes 100 ns and the...
A computer uses virtual memory implemented by paging. The TLB lookup takes 100 ns and the update takes 200 ns. The PT lookup takes 1 µs and the update takes 2 µs. Loading a word from main memory onto the CPU takes 10 µs and loading a page from the disk into main memory takes 10 ms. The TLB hit ratio is 0.4 and the main memory hit ratio is 0.3. Compute the average access time for a referenced word:...
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...
4. Assume it take 50 nanoseconds to resolve a memory reference when accessing the physical memory address directly. a) We designed a system using virtual addresses with page tables without a TLB. In...
4. Assume it take 50 nanoseconds to resolve a memory reference when accessing the physical memory address directly. a) We designed a system using virtual addresses with page tables without a TLB. In other words, when fetching data from memory, the page table is accessed to get the PTE for translating an address, a translation is completed, and finally, a memory reference to the desired data is resolved. In this system, what is the effective memory reference time. Assume the...
Number Name 3. Assuming no page fault on a page table access, what is the processor...
Number Name 3. Assuming no page fault on a page table access, what is the processor memory access time for the system depicted in the above figure, for a physical memory with 50ns read/write times? 4. Now, assume that the memory system has a translation look-aside buffer (TLB). The TLB requires 10 ns to determine a hit or mess. The physical memory system has an access time of 50ns. You may assume that page fault rate for the application is...
A certain byte-addressable computer system has 32-bit words, a virtual address space of 4GB, and a...
A certain byte-addressable computer system has 32-bit words, a virtual address space of 4GB, and a physical address space of 1GB. The page size for this system is 4 KB. Assume each entry in the page table is rounded up to 4 bytes. a) Compute the size of the page table in bytes. b) Assume this virtual memory system is implemented with a 4-way set associative TLB (Translation Lookaside Buffer) with a total of 256 address translations. Compute the size...
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
A computer uses a byte-addressable virtual memory system with a four-entry TLB and a page table...
A computer uses a byte-addressable virtual memory system with a four-entry TLB and a page table for a process P. Pages are 16 bytes in size. Main memory contains 8 frames and the page table contains 16 entries. a. How many bits are required for a virtual address? b. How many bits are required for a physical address?
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)
Question # 3 Consider a demand-paged system where the page table for each process resides in main...
Question # 3 Consider a demand-paged system where the page table for each process resides in main memory. In addition, there is a fast associative memory (also known as TLB which stands for Translation Look-aside Buffer) to speed up the translation process. Each single memory access takes 1 microsecond while each TLB access takes 0.2 microseconds. Assume that 2% of the page requests lead to page faults, while 98% are hits. On the average, page fault time is 20 milliseconds...
Please answer the following questions about paged memory... A) How much space needs to be allocated...
Please answer the following questions about paged memory... A) How much space needs to be allocated in the minimum and maximum cases for a two-level page table for a machine with a 32-bit virtual memory address, a 1K page size, and which has four times as many inner pages as outer pages? Assume any stored page table value requires 32 bits. B) For the two-level paging approach above, if a Translation Lookaside Buffer (TLB) is used and can cache both...
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...
4. Assume it take 50 nanoseconds to resolve a memory reference when accessing the physical memory address directly. a) We designed a system using virtual addresses with page tables without a TLB. In other words, when fetching data from memory, the page table is accessed to get the PTE for translating an address, a translation is completed, and finally, a memory reference to the desired data is resolved. In this system, what is the effective memory reference time. Assume the...
Number Name 3. Assuming no page fault on a page table access, what is the processor memory access time for the system depicted in the above figure, for a physical memory with 50ns read/write times? 4. Now, assume that the memory system has a translation look-aside buffer (TLB). The TLB requires 10 ns to determine a hit or mess. The physical memory system has an access time of 50ns. You may assume that page fault rate for the application is...
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
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)
Question # 3 Consider a demand-paged system where the page table for each process resides in main memory. In addition, there is a fast associative memory (also known as TLB which stands for Translation Look-aside Buffer) to speed up the translation process. Each single memory access takes 1 microsecond while each TLB access takes 0.2 microseconds. Assume that 2% of the page requests lead to page faults, while 98% are hits. On the average, page fault time is 20 milliseconds...
Most questions answered within 3 hours.
-
A
29.0 cm diameter coil consists of 23 turns of cylindrical copper
wire 2.00 mm in...
asked 2 minutes ago -
(1) Write the net ionic equation for the reaction that occurs
when equal volumes of 0.191...
asked 8 minutes ago -
Q1
Two of your friends each received the results of their
first midterm exam this term....
asked 19 minutes ago -
A 0.500-kg object, suspended from an ideal spring of spring
constant 30.2 N/m, is oscillating vertically....
asked 17 minutes ago -
Please help and show work. I keep getting the wrong answers for
these problems
1. Cell...
asked 14 minutes ago -
If there is a SNP in the read with respect to the
reference genome, how would a...
asked 17 minutes ago -
Early black-and-white television sets used an electron beam to
draw a picture on the screen. The...
asked 19 minutes ago -
What is the standard error of M (denoted as
σM ) ?
Options:
The mean of...
asked 43 minutes ago -
Explain the role of n, the sample size, in determining the size
of a generated confidence...
asked 32 minutes ago -
Kelsey Drums, Inc., is a well-established supplier of fine
percussion instruments to orchestras all over the...
asked 46 minutes ago -
In a criminal case, the state must not prove its case beyond a
reasonable doubt. T/F
asked 51 minutes ago -
5.6 dm^3 of gaseous HCl (as measured in normal conditions) is
dissolved in 100 cm^3 of...
asked 1 hour ago