Graded Discussion board
GDB of CS604 will be conducted on Thursday, 07 February, 2019. It will remain open for two days.
Consider a situation in which system is using demand paging technique to load pages from Swap Space to Main Memory. Let’s suppose that a process needs to be loaded in Main Memory. Initially, there are no pages of that process in Main Memory and no free frames are available in main memory.
In that situation, which technique will be used so that process can be loaded in the main memory without affecting the degree of multi-programming and either the page fault rate will increase or decrease thereby increasing or decreasing the performance of system?
You are required to give your own opinion. Keep your answer precise and to the point and should not exceed 6 to 8 lines.
Yes but if you use like FIFO algorithm in page replacement then it cause more page fault then the Least Used algorithm.
hence if we use good page replacement algorithm then it reduce page fault rate.
Thanks for posting but it not helping to find either page fault rage increase/decrease.
these reference string, will be used by algo
and on the basis of algo further page fault rate will increase / decrease
Bht difficult hai nahi samjh lag raha mjhe ma mada banda hun
Page fault is not occurred because of page replacement. page replacement occurred due to page fault and page fault occurred due to unavailability of frame.
Correct algo prevent more page fault whereas incorrect or inefficient algo cause more page fault.
if you read or watch lecture about FIFO Algo and Recent Past Algo you will see FIFO algo cause more page fault rate than Recent Past Algo
Please Discuss here about this GDB.Thanks
Our main purpose here discussion not just Solution
We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>
Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.
For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.
For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.
Or visit this link
Please Click on the below link to see…
P.S: Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”
Check That Friends
Dont forget to remember in your prayes
Here is in written form.
Basic Page Replacement The previously discussed page-fault processing assumed that there would be free frames available on the free-frame list. Now the page-fault handling must be modified to free up a frame if necessary, as follows: 1. Find the location of the desired page on the disk, either in swap space or in the file system. 2. Find a free frame: If there is a free frame, use it. If there is no free frame, use a page-replacement algorithm to select an existing frame to be replaced, known as the victim frame. Write the victim frame to disk. Change all related page tables to indicate that this page is no longer in memory. 3. Read in the desired page and store it in the frame. Adjust all related page and frame tables to indicate the change. 4. Restart the process that was waiting for this page.