3. Consider a paging system with the page table in memory. A. If a memory reference...
3. Consider a paging system with the page table in memory.
A. If a memory reference takes 100 nanoseconds, how long does a paged memory reference take?
B. If we add TLBs, and 75 percent of all page-table references are
found in the TLBs, what is the effective memory
reference time? (Assume that finding a page-table entry for the
TLBs takes 20 nanoseconds.)
C. It takes 750 milliseconds to service a page fault. The page
fault rate is .001. What is the EAT? Include the TLB hit
and miss portions of the equation.
D. What is the purpose of a TLB?
E. What is the purpose of paging?
Homework Answers
Add Answer to:
3. Consider a paging system with the page table in memory.
A. If a memory reference...
3. Consider a paging system with the page table in memory. A. If a memory reference takes 100 nanoseconds, how long does...
3. Consider a paging system with the page table in memory. A. If a memory reference takes 100 nanoseconds, how long does a paged memory reference take? B. If we add TLBs, and 75 percent of all page-table references are found in the TLBs, what is the effective memory reference time? (Assume that finding a page-table entry for the TLBs takes 20 nanoseconds.) C. It takes 750 milliseconds to service a page fault. The page fault rate is .001. What...
Problem 3 (25 points): Consider a paging system with the page table stored in memory. Ifa...
Problem 3 (25 points): Consider a paging system with the page table stored in memory. Ifa memory reference takes 200 nanoseconds, how long does a paged memory reference take? If we add associative registers, and 75 percent of all page-table references are found in the associative registers, what is the effective memory reference time? (Assume that finding a page-table entry in the associative registers takes zero time if the entry is there.) a. b.
Q5. Consider a memory system where all pages fit in memory. The TLB takes 15 nanoseconds...
Q5. Consider a memory system where all pages fit in memory. The TLB takes 15 nanoseconds to access and memory takes 120 nanoseconds to access. What is the effective access time for 1 level paging if the hit rate is 65%? What if it’s 95%? What is the effective access time if not all processes fit into memory and the swap time is 850,000 nanoseconds for a page fault?
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...
8. (5 points) 10.21 Assume we have a demand-paged memory. The page table is held in...
8. (5 points) 10.21 Assume we have a demand-paged memory. The page table is held in registers. It takes 8 milliseconds to service a page fault if an empty page is available or the replaced page is not modified, and 20 if the replaced page is modified. Memory access time is 100 nanoseconds. Assume that the page to be replaced is modified 70 percent of the time. What is the maximum acceptable page- fault rate for an effective access time...
Consider a demand-paging system in which the replacement of a page takes 20 milliseconds (access time...
Consider a demand-paging system in which the replacement of a page takes 20 milliseconds (access time and data transfer). Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, a TLB is added to the system to reduces access time to one memory reference, if the page-table entry is in the associative memory. Assume that...
Consider a demand-paging system with a paging disk that has an average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main memory, with an access time of...
Consider a demand-paging system with a paging disk that has an average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added an associative memory that reduces access time to one memory reference, if the page-table entry is in the associative memory. Assume that 80...
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...
Regarding demand paging, assume an average page fault service time = 25 ms and a memory...
Regarding demand paging, assume an average page fault service time = 25 ms and a memory access time of 100 ns (ms = milliseconds, 1/1000 sec; ns = nanoseconds, 1/1,000,000,000 sec). Calculate the effective access time in ns. Given a page fault rate of 1/1000, calculate the factor by which the computer would be slowed down over not incurring any page fault.
Problem 4 (13 points) Assume we have a demand-paged memory. Assume that the time needed to access...
Problem 4 (13 points) Assume we have a demand-paged memory. Assume that the time needed to access the page table is negligible. It requires 8 milliseconds to handle a page fault if an empty page is available or the replaced page is not dirty, and 20 milliseconds if the replaced page is dirty. Memory access time is 100 nanoseconds. Assume that the page to be replaced is dirty 70 percent of the time. What is the maximum acceptable page-fault rate...
Problem 3 (25 points): Consider a paging system with the page table stored in memory. Ifa memory reference takes 200 nanoseconds, how long does a paged memory reference take? If we add associative registers, and 75 percent of all page-table references are found in the associative registers, what is the effective memory reference time? (Assume that finding a page-table entry in the associative registers takes zero time if the entry is there.) a. b.
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...
8. (5 points) 10.21 Assume we have a demand-paged memory. The page table is held in registers. It takes 8 milliseconds to service a page fault if an empty page is available or the replaced page is not modified, and 20 if the replaced page is modified. Memory access time is 100 nanoseconds. Assume that the page to be replaced is modified 70 percent of the time. What is the maximum acceptable page- fault rate for an effective access time...
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...
Problem 4 (13 points) Assume we have a demand-paged memory. Assume that the time needed to access the page table is negligible. It requires 8 milliseconds to handle a page fault if an empty page is available or the replaced page is not dirty, and 20 milliseconds if the replaced page is dirty. Memory access time is 100 nanoseconds. Assume that the page to be replaced is dirty 70 percent of the time. What is the maximum acceptable page-fault rate...
Most questions answered within 3 hours.
-
The mass spectrum of an organic compound shows the relative
abundances of M to be 53.76%...
asked 32 minutes ago -
Coca Cola’s strategy of “think local, act local” represents a
__________ approach.
Question options:
1)
transnational...
asked 51 minutes ago -
which of the following is not a category of project management
risk?
a) external
b) internal...
asked 1 hour ago -
Focus on Critical Thinking: Are citizen suit provisions an
effective way to achieve environmental objectives? Do...
asked 2 hours ago -
Gaseous butane CH3CH22CH3 will react with gaseous oxygen O2 to
produce gaseous carbon dioxide CO2 and...
asked 2 hours ago -
Required to construct counters using synchronous sequential
logic. Use one hex digit to display the result....
asked 2 hours ago -
(Ultra) Large-Scale Systems –Characteristics?
explain in detail
How the nature of an enterprise affect complex...
asked 2 hours ago -
Some of the antibiotic susceptible strains show colonies within
the clear zone. What it does this...
asked 3 hours ago -
In the lottery game Fantasy 5 you have to select 5 numbers from
the numbers {1,2,3,.......,38,39}....
asked 3 hours ago -
A call option on Jupiter Motors stock with an exercise price of
$80 and one-year expiration...
asked 2 hours ago -
What is the disadvantage of an automated vulnerability scan tool
like Nessus?
prone to false negatives...
asked 3 hours ago -
An Atwood’s machine has m1 = 0.105 kg, m2 = 0.100 kg, hung from
a 5.00...
asked 3 hours ago