Write a program to simulate a demand paging system

Question

rehaam 0 Newbie Poster

14 Years Ago

Hi
I need help;;

Write a program to simulate a demand paging system. The program should implement the FIFO and LRU page replacement algorithms presented in Chapter 10 of the textbook. Your program input should include:

The name of the page replacement algorithm.
Information about the number of physical page frames in the simulated system.
A path name of the file containing a reference string of virtual page numbers.
Your program should apply the reference string on each algorithm and record the number of page faults incurred by each algorithm. The reference string file contains a simple list of integer numbers separated by white space (possibly new line characters). Each integer refers to a virtual page number that is being referenced on that step. If a particular virtual page is not in the physical memory, you must swap it in. If there is not free space in the physical memory to hold the swapped in page, you must select a page to be replaced according to the applied policy. Your program user interface should be kept as simple as possible.

c

2 Contributors
1 Reply
2K Views
19 Hours Discussion Span
Latest Post 14 Years Ago Latest Post by gerard4143

Reply to this topic

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.

gerard4143 371 Nearly a Posting Maven · Answer 1 · 2009-12-15T00:15:27+00:00

Hi
I need help;;
Write a program to simulate a demand paging system. The program should implement the FIFO and LRU page replacement algorithms presented in Chapter 10 of the textbook. Your program input should include:
The name of the page replacement algorithm.
Information about the number of physical page frames in the simulated system.
A path name of the file containing a reference string of virtual page numbers.
Your program should apply the reference string on each algorithm and record the number of page faults incurred by each algorithm. The reference string file contains a simple list of integer numbers separated by white space (possibly new line characters). Each integer refers to a virtual page number that is being referenced on that step. If a particular virtual page is not in the physical memory, you must swap it in. If there is not free space in the physical memory to hold the swapped in page, you must select a page to be replaced according to the applied policy. Your program user interface should be kept as simple as possible.

Please read

http://www.daniweb.com/forums/announcement118-2.html