Terminologies

Paging

Paging is a method of writing data to, and reading it from, secondary storage for use in primary storage, also known as main memory. Paging plays a role in memory management for a operating system.

Page table

A page table is the data structure used by a virtual memory system to store the mapping between virtual addresses and physical addresses.

Page fault

A page fault is a trap to the software raised by the hardware when a program accesses a page that is mapped in the virtual address space, but not loaded in physical memory. In the typical case the operating system tries to handle the page fault by making the required page accessible at a location in physical memory or terminates the program in the case of an illegal access.

An invalid page fault or page fault error occurs when the operating system cannot find the data in virtual memory. This usually happens when the virtual memory area, or the table that maps virtual addresses to real addresses, becomes corrupt.

Logical address

Logical address is the address at which an item (memory cell, storage element, network host) appears to reside from the perspective of an executing application program.

Physical address

Physical address (also real address, or binary address), is a memory address that is represented in the form of a binary number for accessing main memory.

In general, Logical address is the address generated by the CPU. Where as physical address is the actual address of the process in the memory. The CPU generates the logical address that is added with the offset value to get the actual address of the process inthe memory.

Thrashing

Thrashing or disk thrashing is a term used to describe when the hard drive is being overworked by moving information between the system memory and virtual memory excessively.

Demand Paging

Virtual memory is implemented (mostly) using demand paging. Demand Paging is a type of swapping in which pages of data are not copied from disk to RAM until they are needed. This is an example of a lazy loading technique.

Pros:

1. less RAM needed
2. more users
3. less I/O

When a pages is needed, if invalid referernce, abort the process. else if valid, it’s called page fault.

Page fault time:

1. servicing the page fault interrupt
2. read in new page (major part)
3. restart the process

Page Replacement

1. FIFO
2. Optimal Algorithm
3. LRU
4. LRU Approximation
   1. Additional-Reference-Bits algorithm
   2. Second-Chance (Clock) algorithm

Refer to another post “Cache and Page Replacement Algorithms”.

Solution to Thrashing

1. More RAM
2. Less program running together
3. Assign working priorities
4. Improve spatial locality#Solutions) by replacing loops, i.e.

Replace

// recall that in C, arrays use Row-major order
int m[256][256]; 
for (k=0; k<256; k++) { 
    for (i=0; i<256; i++) { 
        m[i][k] = something(); 
    }
}

with

int m[256][256]; 
for (i=0; i<256; i++) { 
    for (k=0; k<256; k++) {
        // consecutive values of k reside in adjacent memory locations 
        m[i][k] = something(); 
    }
}

So that the use of data elements is within relatively close storage locations.