Ask a question from expert

Ask now

3 Frames LRU and FIFO Replacements

5 Pages1586 Words445 Views
   

Added on  2020-04-01

About This Document

The file can be accessed by both the system’s paging file name and the file’s paging structure can be accessed by both the system’s paging file name and the file’s paging structure can be accessed by both the system’s paging file name and the file’s paging structure can be accessed by both the system’s paging file name and the file’s paging structure can be accessed by both the system’s paging file name and the file’s paging structure can

3 Frames LRU and FIFO Replacements

   Added on 2020-04-01

BookmarkShareRelated Documents
Question 1:a)3 FramesLRU Replacement12342156212376321236111444555111777222222222226666333333333333111222226661116FIFO Replacement12342156212376321236111444466663333222262222111222277771111333355511116666633Optimal Replacement123421562123763212361111111111133333333322222222222777222223444566666666611164 Frames:LRU Replacement1234215621237632123611111111111116666666222222222222222222233335555533333333344446666677771111FIFO Replacement1234215621237632123611111155555333331111222222666667777773333333322222666666644444411111122222
3 Frames LRU and FIFO Replacements_1
Optimal Replacement1234215621237632123611111111111177771111222222222222222222233333333333333333344456666666666666b)i)When the required page is not available in the free-frame pool then one of the least recentlyused page from the pool is removed and then the required page is moved from disk to free-frame pool and then to the resident set.ii)When the required page is in free frame pool then the required page is moved from freeframe pool to resident pages and one of the resident page based on FIFO replacement ismoved from resident page to the free frame pooliii)When the number of resident pages is set to 1 then system’s paging algorithm used will befree-frame pool paging algorithm. As the free frame pool paging algorithm is LRU thesystem’s paging algorithm reduces to LRUiv)When the free-frame pool size is zero, the system’s paging algorithm is resident pagesalgorithm. As the resident pages paging algorithm is FIFO. The system’s paging algorithmreduces to FIFO Question 2:a)In UNIX, all the files maintain a data structure called i-node. I-node stores the detailsabout the file. The filenames are used to refer to the data structure whereas the linkrefers to the contents of a file. Generally two types of links are used:i)Hard link: Hard link is used to just point to i-node of the file. For example consider a filea.txt that contains the text “This is sample test”. A hard link is constructed inUNIX with the ln command. A hard link to a.txt is created as follows:ln a.txt b.txtNow both a.txt and b.txt refer to the same i-node.
3 Frames LRU and FIFO Replacements_2

End of preview

Want to access all the pages? Upload your documents or become a member.

Related Documents
Page Replacement with 6 Frames Locked = 17 Page Faults
|4
|1797
|436

Operating System | Assignment 1
|13
|1864
|30

Operating System - Solved Questions and Answers
|7
|1027
|464

Operating System - Desklib
|7
|544
|268

Portions of The Virtual Memory Space
|6
|2195
|693

COMP2240 - Operating Systems
|14
|1528
|224