https://github.com/mtaciano/mempager

Simulation of two different paging algorithms hit-and-miss ratios as they move pages from the swap to the RAM.
https://github.com/mtaciano/mempager

c paging simulation

Last synced: 10 days ago
JSON representation

Simulation of two different paging algorithms hit-and-miss ratios as they move pages from the swap to the RAM.

• Host: GitHub
• URL: https://github.com/mtaciano/mempager
• Owner: mtaciano
• License: mit
• Created: 2024-04-26T17:48:23.000Z (8 months ago)
• Default Branch: main
• Last Pushed: 2024-05-15T16:05:10.000Z (7 months ago)
• Last Synced: 2024-05-15T20:28:49.430Z (7 months ago)
• Topics: c, paging, simulation
• Language: C
• Homepage:
• Size: 26.4 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Memory paging simulation

## About

This program aims at simulating the behavior of two different paging algorithms when the physical memory is full (pages need to be swaped constantly). The main metric is their hit-and-miss ratios as they move pages from the swap to the RAM.

The first one is a `FIFO` (First In First Out) pager, the first page loaded in memory is the first to get released independently of its modified or referenced status.

The second algorithm is a `CLOCK` pager, it uses a circular list to find the first non-referenced page that is loaded and release it from memory.

### Building

To build the program, you can call `cmake` with the configuration you want, or use the `./config.sh` script provided, which is the configuration that I used to write this program.

After that, run `cmake --build build` and the executable will be in the `build` folder.

### Running

To run this program you can do:

```sh

./mempager   

```

Note that the seed is optional, and used if you want both pagers to have the same inputs, for comparison purposes.

## License

MIT License.