Write a program to simulate the page replacement process in a virtual memory system. There is only one program. Assume the program consists of 1000 pages and that initially all pages are in backing store and that main memory is empty. Implement both the FIFO and LRU page replacement algorithms. Copy pages to backing store only if they have been modified. Input to the program will consist of the following information. No particular line fomat is assumed. Fields are to be separated by white space. -string= Replacement Algorithm: FIFO or LRU -int= Number of page frames -int= Trace: 0=no trace; 1=trace each paging action -int;char= Page reference: page number + R for read or W for write =... Repeat page references to end-of-file A trace entry is triggered each time a page is read from backing store or written to backing store. It indicates the operation and the page number. At the end of the program, print a report of the number of page reads from backing store and the number of page writes to backing store. If the debug flag is 0, this will be the only output. Test data will be provide: Run the program with the following files: [url removed, login to view] [url removed, login to view] [url removed, login to view] [url removed, login to view] [url removed, login to view] [url removed, login to view] [url removed, login to view] [url removed, login to view]
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.
Windows and Linux