Drawbacks of least-recently used algorithm, Operating System

The question of fairness, regarding page eviction, is a hard one. How do we decide what is fair? Many operating systems use global LRU, where pages from all processes are managed together using the approximate LRU algorithms described above. This is easy to implement, but has a number of problems.

For instance, with global LRU, there's no isolation between processes, and greedy or badly-written programs will push other programs out of physical memory. In addition, the priority which one gives a program is generally priority for the scheduler, not priority for physical memory (though there are approaches to try to deal with this).

There's also the "sleepyhead" problem, which is where an important but rarely-used programwill get paged out, and then start up slowly. For instance, the ntpd (network time protocol) program doesn't run often, but when it does run, it needs to make precise timing measurements, which would be impacted by pagefaults. ntpd and similar programs can get around this problem by "pinning" their pages, meaning that their physical pages are not allowed to be paged out to disk.

In general, the problem of fairness is that processes that are greedy (or wasteful) are rewarded; processes with poor locality end up squeezing out those with good locality, because they "steal" memory. There is no simple solution to this problem.

Posted Date: 3/12/2013 6:02:44 AM | Location : United States

Related Discussions:- Drawbacks of least-recently used algorithm, Assignment Help, Ask Question on Drawbacks of least-recently used algorithm, Get Answer, Expert's Help, Drawbacks of least-recently used algorithm Discussions

Write discussion on Drawbacks of least-recently used algorithm
Your posts are moderated
Related Questions
Scalability : Scalability is the competence of the system to adapt to increased service load. A scalable system will respond more gracefully to increased load than a non-sc

NEXT FIT ALGORITHM Here scanning starts from the first fit position and then it finds the next position which is large sufficient to hold the process. Thus the name next fit.

What is the information associated with an open file? Various pieces of information are associated with  an open file which may be: File pointer Disk location of th

What is the use of FIFOs in client-server applications

Determine an imperative statement Imperative statement points out an action to be carried out during execution of assembled program

Elimination of common sub expression during code optimization An optimizing transformation is a rule for rewriting a section of a program to enhance its execution efficiency wi

using the transformation process model and system thinking concepts explain the key operation of TGL works.

Explain Deadlock Every process in a set of processes is waiting for an event which only a process in the set can cause.