ZuoTi.Pro
Question

Given that main memory is composed of four page frames for public use, use the following...

Given that main memory is composed of four page frames for public use, use the following table to answer all parts of this problem:

Page Frame   Time When Loaded Time When Last Referenced Referenced BIT      Modified BIT
0 09 307 0 0
1 17 362 1 0
2 10 294 0 1
3 160 369 1 1
  1. The contents of which page frame would be swapped out by FIFO?
  2. The contents of which page frame would be swapped out by LRU?
  3. The contents of which page frame would be swapped out by MRU?
  4. The contents of which page frame would be swapped out by LFU?
engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

ANSWER:-

the given table is :--

a) FIFO means first in first out so in this page replacement algorithm the page frame whch was loaded first will be swapped out
the given table page frame 0 was loaded at time 9 i.e earliest and it will be swapped out.
b) LRU means least recently used and from the given table Page Frame 2 was the least recently used
we can say that it is idle from a longer time as compared to others so in LRU Page 2 will be swapped out.
c) Page frame 3 will be swapped out by MRUbecause it has been referenced most recently.
We come to know thisby seeing the Time When Last Referenced.
(d) By LFU page frame 0 will be swapped outbecause it is the one which is used less frequently.
The referencebit and modified bits of page frame 0 are 0 and0 respectively.
That means, it is neither referenced normodified. So it is the one which is being used lessfrequently.

0 0
Add a comment
Know the answer?
Add Answer to:
Given that main memory is composed of four page frames for public use, use the following...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Given that main memory is composed of three page frames for public use and that a...

    Given that main memory is composed of three page frames for public use and that a program requests pages in the following order: A, B, C, D, A, B, E, A, B, C, D, E, B, A, B Using the FIFO page removal algorithm, perform a page trace analysis indicating page faults with asterisks (*). Then compute the failure and success ratios Using the LRU page removal algorithm, perform a page trace analysis and compute the failure and success ratios....

  • Given that main memory is composed of four page frames for public use and that program...

    Given that main memory is composed of four page frames for public use and that program requests pages in the following order: a, b, a, b, f, d, f ,c, g, f, a, b, d, e, k, m Using FIFO removal algorithm, perform a page trace analysis and indicate page faults with asterix(*). Then calculate failure rate. Using LRU removal algorithm, perform a page trace analysis and indicate page faults with asterix(*). Then calculate failure rate.

  • 1. Given that main memory is composed of only three page frames for public use and...

    1. Given that main memory is composed of only three page frames for public use and that a seven-page program (with pages a, b, c, d, e, f, g) that requests pages in the following order: a, c, a, b, a, d, a, c, b, d, e, f a. Using the FIFO page removal algorithm, indicate the movement of the pages into and out of the available page frames (called a page trace analysis) indicating each page fault with an...

  • 4. (25 points ) A computer has four page frames, The time of loading, time of...

    4. (25 points ) A computer has four page frames, The time of loading, time of last access, and the R ( referenced ) and M ( Modified ) bits for each page are shown below ( the times are in clock ticks) : Loaded 126 M Page Last Reference R. 0 0 279 1 230 260 120 150 272 2 1 280 1 3 Answer and explain briefly your answer for each of the following: a) Which page will...

  • 5) (20 pts) Given a memory with 4 frames, the frame table, page table and reference...

    5) (20 pts) Given a memory with 4 frames, the frame table, page table and reference table as shown in the first line; and given that the next frame to be scanned is frame 0: Give the contents of the frame table, the reference bits and the page table after each of the six page requests listed below. Use a -1 in the page table to indicate a page is not in RAM 3 4 3 2 0 1 5...

  • 3. Virtual Memory (20 points) An ISA supports an 8 bit, byte-addressable virtual address space. The...

    3. Virtual Memory (20 points) An ISA supports an 8 bit, byte-addressable virtual address space. The corresponding physical memory has only 256 bytes. Each page contains 32 bytes. A simple, one-level translation scheme is used and the page table resides in physical memory. The initial contents of the frames of physical memory are shown below. VALUE address size 8 bit byte addressable each byte of addressing type memory has its own address 32 B page size physical memory size 256...

  • Problem 6 (13 points) The page table below is for a system with 16-bit virtual as well as physica...

    Problem 6 (13 points) The page table below is for a system with 16-bit virtual as well as physical addresses and with 4,096-byte pages. The reference bit is set to 1 when the page has been referenced. Periodically, a thread zeroes out all values of the reference bit. A dash for a page frame indicates the page is not in memory. The LRll pagg-replacement algorithm is used. The numbers are given in decimal Page Frame eferepceit 14 10 13 15...

  • For part A: convert the virtual address into page numbers and offset, and then into hexadecimal...

    For part A: convert the virtual address into page numbers and offset, and then into hexadecimal numbers. Redraw the page table showing which pages were referenced and in any needed to be loaded into memory and what frame was selected. Assume frames 6,7,11,and 12 are available. 9.22 The page table shown in Figure 9.32 is for a system with 16-bit virtual and physical addresscs and with 4,096-byte pages. The reference bit is been referenced. Periodically, a thread zeroes out all...

  • 2q62/Operating systems. PLs, detail of step1 tp step n A computer has five page frames. The...

    2q62/Operating systems. PLs, detail of step1 tp step n A computer has five page frames. The time of loading, time of last access, and the Referenced and Modified bit for each page are shown below (with time in clock ticks) For each of the following algorithms, which page would be the next to be replaced? Least recently used Not recently used First in, first out Second chance Clock

  • In systems using virtual memory, some memory frames are made permanently resident i.e., pages loaded into those frames can never be paged out to make space for resolving a page fault. Of what use woul...

    In systems using virtual memory, some memory frames are made permanently resident i.e., pages loaded into those frames can never be paged out to make space for resolving a page fault. Of what use would such ‘resident frames’ be to the OS?

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT