Add the rest of university notes
This commit is contained in:
366 files changed
+9844
-110
No files matched your search
@@ -73,11 +73,11 @@ Paging uses the principles of **fixed partitioning** and **code re-location** to
|
||||
> * **Internal fragmentation** is reduced to the **last block only** (e.g. previous example the third block, only 3 Kb will be used)
|
||||
> * There is **no external fragmentation**, since physical blocks are **stacked directly onto each other** in main memory.
|
||||
|
||||

|
||||

|
||||
|
||||

|
||||

|
||||
|
||||

|
||||

|
||||
|
||||
A **page** is a **small block** of **contiguous memory** in the **logical address space** (as seen by the process)
|
||||
|
||||
@@ -93,9 +93,10 @@ A **page** is a **small block** of **contiguous memory** in the **logical addres
|
||||
* i.e a **set of base registers** has to be maintained for each process
|
||||
* The base registers are stored in the **page table**
|
||||
|
||||

|
||||

|
||||
|
||||
The page table can be seen as a **function**, that **maps the page number** of the logical address **onto the frame number** of the physical address
|
||||
|
||||
$$
|
||||
frameNumber = f(pageNumber)
|
||||
$$
|
||||
@@ -103,7 +104,7 @@ $$
|
||||
* The **page number** is used as an **index to the page table** that lists the **location of the associated frame**.
|
||||
* It is the OS' duty to maintain a list of **free frames**.
|
||||
|
||||

|
||||

|
||||
|
||||
We can see that the **only difference** between the logical address and physical address is the **4 left most bits** (the **page number and frame number**). As **pages and frames are the same size**, then the **offset value will be the same for both**.
|
||||
|
||||
|
||||
Reference in new issue
Block a user