This is an implementation of a popular LRU (least recently used) algorithm which is a page-replacement algorithm used in the virtual memory management system.

This is an implementation of a stack-algorithm version.

• Page size is equal to 64 bytes
• We can only keep 5 virtual addresses at the time
• The memory is bte addressable
• No TLB/Cache taken into account

Default
adr.txt -> contains virtual addresses
logs.txt -> well, logs

Check the main.c where you can update filenames as well as their paths.

The algorithm is 100% memory safe, does not trigger any error nor warnings. Tested with valgrind 3.19.0.

• No memory leaks detected
• No warnings occurred
• No invalid memory reads/writes