Explain the demand paging system, Operating System

Assignment Help:

Question :

(a) In the demand paging system, when a process tries to access a page that was not brought into memory, a page fault occurs that involves a series of actions. The diagram shows the steps involved in dealing with this situation. Give a clear description of this page fault situation and define the steps numbered 1 to 6.

1744_Implement the algorithm that results in the lowest page-fault rate.png

(b) Consider the following page-reference string:

1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6

If a system consists of 3 frames, how many page faults will occur for the following replacement algorithms?

i) FIFO algorithm
ii) Optimal algorithm
iii) LRU algorithm

Related Discussions:- Explain the demand paging system

Nested Macro calls, . Nested Macro calls are expanded using the

. Nested Macro calls are expanded using the

Transportation, what are the factors influencing the choice of a mode of tr...

what are the factors influencing the choice of a mode of transportation?

Shell scripting, A friend has promised to log in at a particular time. Howe...

A friend has promised to log in at a particular time. However, he needs to be contacted as soon as he logs in. The shell script checks after every minute whether he has logged in o

Page fault handling , Page Fault Handling conditions like, where the copy...

Page Fault Handling conditions like, where the copy on write bit of a page is set and that page is send by more than one process, the Kernel assign new page and copies the conten

What are the various disk-scheduling algorithms, What are the various disk-...

What are the various disk-scheduling algorithms? The several disk-scheduling algorithms are a. First Come First Served Scheduling b. Shortest Seek Time First Scheduling

Memory organization and decoding, In a p system each part (RAM, ROM, I/O) ...

In a p system each part (RAM, ROM, I/O) has a unique set of numbers. The allocation of these numbers is usually stated in the form of a memory map. This is a plot of data bus agai

Life of a page, Suppose your process starts up, and allocates some memory w...

Suppose your process starts up, and allocates some memory with malloc(). The allocator will then give part of a memory page to your process. The OS then updates the corresponding p

Write a short note on file organization and access, Write a short note on f...

Write a short note on file organization and access. There are three methods to access files 1Record Access 2Sequential Access 3Random Access The record access

Explain basic file system file system architecture, Basic File System ...

Basic File System Uses the specific device driver. Deals with blocks of data that are exchanged with the physical device. Concerned with the placement of blocks on

Compute how many disk input - output operations are required, Q. Consider ...

Q. Consider a file at present consisting of 100 blocks. Presume that the file control block (and the index block in the case of indexed allocation) is already in memory. Compute h

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages