applications on the replacement algorithms

In this work we examine the behavior of applications on the replacement algorithms. The application will simulate the behavior of system memory management based on actual memory traces references (reference trace).We have given to you two (gzipped) files of reports [1], [2]. Each file contains a number of lines showing hexadecimal memory references followed by the indices R or W to determine whether recording or reading. The simulator will read the file and will execute the mechanism of virtual memory based on an inverted page table. The simulator needs to know which pages have been loaded into main memory. When results a report from the trace reports the simulator will check whether the page is in main [login to view URL] not this and the memory is already saturated, the simulator will have to decide which page it removes (page replacement). If the page to be removed has been changed should be saved to disk(just print a message “Data shaved in disk??). When a new page is loaded the page table should be updated suitably. All pages and frames have size of 4 KB (4096 bytes). It should be implemented 2 replacement algorithms: LRU and Working Set (WS).The parameter of the WS (window of previous references) is given as an argument at the implementation of the simulator. When results the need for writing in the disk (or reading) the incident should be recorded to appropriate counters of program of simulation. The program will read alternately totals reports (number q) of each trace file in order to have in the central memory pages from the 2 processes. The program will accept as arguments the replacement algorithm, the number of frames of central memory, the number q and the window size for the algorithm WS (if required).It can also be determined the biggest number of references (max) that will be examined by the files of trace. With the completion of simulation, will be displayed statistics such as number of write / read from disk, page faults, records examined by the trace file references, number of frame memory. Delivery Date: 23/03/2009 Delivery Method: will be delivered a tar file containing all relevant files: source and header files, makefile, etc. Accompanying material: 2-page document that explains the program and give brief details. Implementation: The work is personal, should be implemented in language C The work will be considered in system Linux ## Deliverables I would like to have two solutions for my exercise. I will pay with euros 60.00 Euros = 77.82600 US$