February 2014 Archive


The WSClock Page Replacement Algorithm
1210 views
The WSClock Page Replacement Algorithm

The main working set algorithm is unwieldy, since the entire page table has to be scanned at each page fault until a suitable candidate is located. An improved algorithm, that is based on the clock algorithm but also uses the working set information, is called WSClock (Carr and

Summary of Page Replacement Algorithms
891 views
Summary of Page Replacement Algorithms

We have now considered a variety of page replacement algorithms. In this section we will briefly summarize them. The list of algorithms discussed is given in Figure 1.

DESIGN ISSUES FOR PAGING SYSTEMS
1705 views
DESIGN ISSUES FOR PAGING SYSTEMS

In the preceding sections we have described in detail how paging works and have given a few of the fundamental page replacement algorithms and shown how to model them. But knowing the bare mechanics is not sufficient To design a system, you have to know a lot more

Load Control
1018 views
Load Control

Even with the best page replacement algorithm and optimal global allocation of page frames to processes, it can come about that the system thrashes. Actually, whenever the combined working sets of all processes exceed the capacity of memory, thrashing can be expected. One

Page Size
1335 views
Page Size

The page size is sometimes a parameter that can be chosen by the operating system. Even if the hardware has been designed with, for instance, 512-byte pages, the operating system can easily regard page pairs 0 and 1, 2 and 3, 4 and 5, and so on, as 1-KB pages by always

Page 1 of 1 Previous 1 Next