1.      What are conditions for a machine to support Demand Paging?

Ø      Memory architecture must based on Pages,

Ø      The machine must support the ‘restartable’ instructions.

 

2.      What is ‘the principle of locality’?

It’s the nature of the processes that they refer only to the small subset of the total data space of the process. i.e. the process frequently calls the same subroutines or executes the loop instructions.

 

3.      What is the working set of a process?

The set of pages that are referred by the process in the last ‘n’, references, where ‘n’ is called the window of the working set of the process.

 

4.      What is the window of the working set of a process?

The window of the working set of a process is the total number in which the process had referred the set of pages in the working set of the process.

 

5.      What is called a page fault?

Page fault is referred to the situation when the process addresses a page in the working set of the process but the process fails to locate the page in the working set. And on a page fault the kernel updates the working set by reading the page from the secondary device.

 

6.      What are data structures that are used for Demand Paging?

            Kernel contains 4 data structures for Demand paging. They are,

Ø      Page table entries,

Ø      Disk block descriptors,

Ø      Page frame data table (pfdata),

Ø      Swap-use table.

 

26.  What are the bits that support the demand paging?

Valid, Reference, Modify, Copy on write, Age. These bits are the part of the page table entry, which includes physical address of the page and protection bits.

 

Page address

 

Age

Copy on write

Modify

Reference

Valid

Protection

 

27.  How the Kernel handles the fork() system call in traditional Unix and in the System V Unix, while swapping?

            Kernel in traditional Unix, makes the duplicate copy of the parent’s address space and attaches it to the child’s process, while swapping. Kernel in System V Unix, manipulates the region tables, page table, and pfdata table entries, by incrementing the reference count of the region table of shared regions.

Advertisements