4 Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page acces...
4 Consider a virtual memory system with FIFO page
replacement policy. For an arbitrary page access pattern,
increasing the number of page frames in main memory will (GATE CS
2001)
a) Always decrease the number of page faults
b) Always increase the number of page faults
c) Some times increase the number of page faults
d) Never affect the number of page faults
Homework Answers
Answer :
(C) sometimes increase the number of page
faults
It is always not sure incrementing the number of frames will reduce the page faults
Note : If you like my answer please rate and help me it is very Imp for me
Add Answer to:
4 Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page acces...
3. Assume a virtual memory system with the following properties: • The physical memory available to...
3. Assume a virtual memory system with the following properties: • The physical memory available to an application consists of four-page frames, with frame numbers 0, 1, 2, and 3. The application has six pages of data in its virtual address space, using page numbers 0, 1, 2, 3, 4, and 5. Build a table showing which frame is used to bring in each page for the following sequences of page references using FIFO, MIN, and LRU as page replacement...
Which of the following about virtual memory is not true? A) Virtual memory needs paging hardware...
Which of the following about virtual memory is not true? A) Virtual memory needs paging hardware B)Virtual Memory uses storage device to extend the physical main memory C)The optimal replacement strategy is the most practical strategy D)Multiple process can share pages What should we do when having a page fault (Multiple answers)? A)Skip the machine instruction causing the page fault. B)Update the page table after loading the missing page C) Switch to a process that does not have page faults...
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)
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
Consider the following virtual page reference sequence: page 1, 2, 3, 4, 2, 1, 5, 6,...
Consider the following virtual page reference sequence: page 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3. This indicates that these particular pages need to be accessed by the computer in the order shown. Consider each of the following 4 algorithm-frame combinations: LRU with 3 frames FIFO with 3 frames LRU with 4 frames FIFO with 4 frames . For each of the 4 combinations, below, move from left to right as the virtual page numbers are...
find the number of page faults that occur during FIFO, OPT, LRU cafe replacement with 4...
find the number of page faults that occur during FIFO, OPT, LRU cafe replacement with 4 frames. Mention the number of page faults after each replacement strategy. If you find any ties replace the page with the highest numeric value. Here is the reference of string pages. 9 2 6 9 6 0 5 5 6 0 3 1 6 1 0
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 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...
Implement the frame replacement algorithm for virtual memory Assume a computer system have 10 memory frames available inside the physical memory and is required to execute a process containing 20 pa...
Implement the frame replacement algorithm for virtual memory Assume a computer system have 10 memory frames available inside the physical memory and is required to execute a process containing 20 pages. Assume a process P has been executed in the system and produced a sequence of 40 page demands as follows: Page demands trace of process P Demand 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 cont. Page...
Consider the following page reference string for a three-frame memory: 6 3 1 5 3 4...
Consider the following page reference string for a three-frame memory: 6 3 1 5 3 4 3 2 5 4 3 4 5 1 5 3 1 6 3 1 Apply LRU, Clock and FIFO algorithms What will be the number of page faults for each replacement algorithm note that page faults at the beginning are counted?
3. Assume a virtual memory system with the following properties: • The physical memory available to an application consists of four-page frames, with frame numbers 0, 1, 2, and 3. The application has six pages of data in its virtual address space, using page numbers 0, 1, 2, 3, 4, and 5. Build a table showing which frame is used to bring in each page for the following sequences of page references using FIFO, MIN, and LRU as page replacement...
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)
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
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...
Most questions answered within 3 hours.
-
Determine the temperature (in Celsius) at which 1.00 mole of an
ideal gas will have a...
asked 3 minutes ago -
[1] Household statistics include individuals living alone or in
groups in:
A) apartments.
B) military barracks....
asked 6 minutes ago -
What is the % w/v when 80 mL of a 2.0% solution is mixed with 50...
asked 10 minutes ago -
How can I solve the following using a TI83
Claim: Most adults would erase all of...
asked 23 minutes ago -
Analysis of 3-ethyl-3-buten-2-ol gave C, 72.13%; H, 11.92%.
Calculate the percent deviation of these results from...
asked 20 minutes ago -
Which VALS segment is most likely to have a top of the line
brand new (2015)...
asked 24 minutes ago -
Write a program to score the paper-rock-scissor game. Each of
two users types in either P,R...
asked 44 minutes ago -
Calculate the equillibrium constent K for a redox reaction that
has E°cell = -.98 V at...
asked 56 minutes ago -
A concave spherical mirror has a radius of curvature of
magnitude 19.6 cm.
(a) Find the...
asked 57 minutes ago -
3. draw a diagram of the magnetic field:
a. around a long straight wire with a...
asked 56 minutes ago -
If you titrated 30.0 mL of 0.1 M HCl with 0.1 M NaOH, indicate
the approximate...
asked 1 hour ago -
NADH passes electrons into the electron transport chain. List
the carriers that would receive the electrons,...
asked 1 hour ago