There are two ways to run the algorithm:
- Upload a file with the settings:
python core.py -f <file name>- Example:
python core.py -f settings1.txt
- Generate the settings:
python core.py -g <memory size> <process queue size> <number of different processes> <save to file (optional)>- Example (not saved to file):
python core.py -g 2 12 4 - Example (save to file):
python core.py -g 2 12 4 -s
The configuration file must have the following structure:
- 1st line: memory size.
- 2nd line: Initial memory status. (Use
0to represent empty positions, if any). - 3rd line: Queue of processes to be executed.
- 4th line: Action to be taken for each process (
Rfor read orWfor write).
Use | to represent each processor clock.
To simulate memory, a class was used that has an attribute called memory, with the following structure:
memory = {
'lenght': memory lenght,
'memory': [
[
process,
valid,
present,
referenced,
modified,
frame/disk
]
]
}To manage the free spaces, a greedy algorithm was used, which runs through the memory from beginning to end and takes the first free space it finds.
The following page exchange algorithms were implemented:
- Optimal Algorith
- FIFO
- Second Chance
- LRU
- NRU