April 2014 Archive


Cleaning Policy / Virtual Memory Interface
1515 views
Cleaning Policy / Virtual Memory Interface

Paging works best when there are lots of free page frames that can be claimed as page faults take place. If every page frame is full, and moreover customized, before a new page can be brought in, an old page must first be written to disk. To make sure a plentiful supply of free

IMPLEMENTATION ISSUES
1342 views
IMPLEMENTATION ISSUES

Implementers of virtual memory systems have to make selections among the major theoretical algorithms, such as second chance versus aging, local versus global page allocation, and demand paging versus prepaging. But they also have to be aware of a number of practical

Instruction Backup
1112 views
Instruction Backup

When a program references a page that is not in memory, the instruction causing the fault is stopped partway through and a trap to the operating system takes place. After the operating system has fetched the page required, it must restart the instruction causing the trap. This

Backing Store
1740 views
Backing Store

In our study of page replacement algorithms, we saw how a page is chosen for removal. We have not said much about where on the disk it is put when it is paged out. Let us now explain some of the problems related to disk management. The simplest algorithm for allocating page

Page 1 of 1 Previous 1 Next