The different paging techniques are
1. Multilevel paging or hierarchical paging method: In definite cases the page table may consist up to 1 million entries. This would be as well large to accommodate in the main memory. One simple solution with this problem is to divide the page table into smaller pieces.
2. Hashed page table method: A general method for handling address spaces larger than 32 bits is to use a hashed page table with the hash value being the virtual page number. Every entry in the hash table contains a linked list of elements that hash to the same location.
3. Inverted page table method: An inverted page table has one entry for every real page of memory. Every entry consists of the virtual address of the page stored in threat real memory location, along with information about the process that owns that page.
4. Shared pages method: Shared page tables are typically implemented as multiple virtual addresses that are mapped to one physical address.
5. Demand paging method: This is alike to a paging system with swapping. Processes inhabit on the secondary memory. When we would like to execute a process, we swap it in to the memory.