https://github.com/abraaohonorio/page-replacement-algorithms
Implementation of algorithms for replacing pages in memory
https://github.com/abraaohonorio/page-replacement-algorithms
Last synced: 3 months ago
JSON representation
Implementation of algorithms for replacing pages in memory
- Host: GitHub
- URL: https://github.com/abraaohonorio/page-replacement-algorithms
- Owner: AbraaoHonorio
- Created: 2017-02-09T23:27:57.000Z (over 8 years ago)
- Default Branch: master
- Last Pushed: 2017-03-20T14:44:44.000Z (about 8 years ago)
- Last Synced: 2025-01-15T14:16:10.644Z (5 months ago)
- Language: C++
- Size: 102 KB
- Stars: 2
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Page-Replacement-Algorithms
Implementation of algorithms for replacing pages in memory
## Algorithms
- FIFO (First-in-First-out)
- OTM (Optimal Algorithm)
- LRU (Last Recent Used)
### Page replacement
The input is a list of integer numbers, one per line, whose first number indicates
the number of available frames in RAM, and the rest indicates the sequences
of references to memory. E.g.:
4
1
2
3
4
1
2
5
1
2
3
4
5
## Output
The program emits, for every page replacement algorithm, the number of page faults.
For example, for the example given above, we have as result:
FIFO 10
OTM 6
LRU 8
### Building for source
```sh
make all
```
## Reference
[Nobr15]
Alexandre Nóbrega. 2015.
Site of Operating Systems course.
Available at http://alexandre.ci.ufpb.br/ensino/so/.