: A memory management technique where inactive processes are temporarily moved to the hard disk to free up space in RAM, and new or active proccesses are loaded into memory
Load processes of different size sequentially into memory
1) First fit
2) best fit
3) worst fit
: occurs when free memory is devided into samll, non-contiguous blocks due to loading and removing proccesses of different size
S1. Compaction: Move processes in memory closer together and combine free spaces into a single contiguous block.
: a memory technique that provides the illusion of larger and contiguous memory space for each process, even though the physical memory may be fragmented or limited.
: Divides both logical memory(process) and physical memory(RAM) into fixed size blocks:


π Page Swapping
Instead of swapping the entire process, the system loads or swaps only the necessary pages
: A structure that maps each logical page number to its corrseponding physical frame number.

π§± Page Table Entry (PTE) Fields:
when valid bit 0, if CPU tries to access to the page, then exception(page fault) occurs
: A small, fast cache inside the MMU that stores recent page table entries
A Memory Management Unit (MMU) is a hardware component that translates virtual memory addresses (used by the CPU) into physical memory addresses (used by the RAM)

: Used during process creation (fork()) to share pages between parent and child until one modifies the page
ex) Fork()
Initially, both processes point to the same physical frame (read-only)

However, if parent or child write something on the page, then create a new frame and the page is reassigned to that frame
