Optimal page replacement algorithm in java

Demand PagingДЄ demand paging system is quite similar to a paging system with swapping where processes reside in secondary memory and pages are loaded only on demand, not in advance. Demand segmentation can also be used to provide virtual memory. It can also be implemented in a segmentation system. Virtual memory is commonly implemented by demand paging. The MMU's job is to translate virtual addresses into physical addresses. Modern microprocessors intended for general-purpose use, a memory management unit, or MMU, is built into the hardware. Less number of I/O would be needed to load or swap each user program into memory.ДЄ program would no longer be constrained by the amount of physical memory that is available.Д®ach user program could take less physical memory, more programs could be run the same time, with a corresponding increase in CPU utilization and throughput. The ability to execute a program that is only partially in memory would counter many benefits. Many tables are assigned a fixed amount of address space even though only a small amount of the table is actually used. User written error handling routines are used only when an error occurred in the data or computation.Д¬ertain options and features of a program may be used rarely. Second, it allows us to have memory protection, because each virtual address is translated to a physical address.ДЇollowing are the situations, when entire program is not required to be loaded fully in main memory.

First, it allows us to extend the use of physical memory by using disk. The main visible advantage of this scheme is that programs can be larger than physical memory. This extra memory is actually called virtual memory and it is a section of a hard disk that's set up to emulate the computer's RAM. A computer can address more memory than the amount physically installed on the system.

Optimal page replacement algorithm in java