What is the basic approach of page replacement, Operating System

Assignment Help:

What is the basic approach of page replacement?

If no frame is free is available, find one that is not presently being used and free it. A frame can be freed by writing its contents to swap space, and changing the page table to show that the page is no longer in memory. Now the freed frame can be used to hold the page for which the process faulted.

Related Discussions:- What is the basic approach of page replacement

Accounting for investment, Case laws related to accounting for investment

Case laws related to accounting for investment

What are scheduling queues?, What are scheduling queues? Since the proc...

What are scheduling queues? Since the processes enter the system they are put into job queue. This queue contains all processes in the system. The processes that are exist in m

Determine the syntax of the fork and join primitive, Determine the syntax o...

Determine the syntax of the Fork and Join Primitive Answer: Syntax of the Fork and Join Primitive is as follow: Fork Join

Disk scheduling algorithms-first come, FCFS (First Come, First Served) Per...

FCFS (First Come, First Served) Perform operations in order requested No reordering of work queue No starvation every demand is serviced Poor performance

Sector sparing, What is sector sparing is proper definition

What is sector sparing is proper definition

Identifying parallelism, Identifying parallelism A formal way to identi...

Identifying parallelism A formal way to identify parallelism in an activity is to draw a task dependence graph in a directed graph in which each vertex represents a task to

Management Information Systems, Select any business process within this fir...

Select any business process within this firm, describe it as a set of steps then fill the following table (flow, information, sender and receivern #Minimum 100 words accepted#

Define a set of methods that allow executing a program, A set of methods th...

A set of methods that allow executing a program which is not completely in memory is called A set of methods that allow executing a program which is not completely in memory

Explain many-to-one model (green threads), Many-to-One Model (Green Threads...

Many-to-One Model (Green Threads) Implementations of the many-to-one model a lot of user threads to one kernel thread permit the application to create any number of threads tha

Advanced synchronization in operating system, Recall that condition variabl...

Recall that condition variables are synchronization primitives that enable threads to wait until a particular condition occurs. Generalizing, the combination of locks and condit

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages