Local replacement algorithm
- Local replacement algorithm
With multiple processes competing for frames, we can classify page-replacement algorithms into two broad categories:global replacement and local replacement.Global replacement allows a process to select a replacement frame from the set of all frames,even if that frame is currently allocated to some other process;that is; one process can take a frame from another.Local replacement requires that each process select from only its own set of allocated frames.
Overview
For example, consider an allocation scheme where we allow high-priority processes to select frames from low-priority processes for replacement.A process can select a replacement from among its own frames or the frames of any low-priority process.This approach allows a high-priority process to increase its frame allocation at the expense of a low-priority process.
With a local replacement strategy, the number of frames allocated to a process does not change.With global replacement, a process may happen to select only frames allocated to other processes, thus increasing the number of frames allocated to it (assuming that other processes do not choose its frames for replacement).
One problem with global replacement is that a process cannot control its own page-fault rate.The set of pages in memory for a process depends not only on the paging behavior of that process but also on the paging behavior of other processes.Therefore,the same process may perform quite differently(for example,taking 0.5 seconds for one execution and 10.3 seconds for the next execution) because of totally external circumstances.
Under local replacement, the set of pages in memory for a process is affected by the paging behavior of only that process.Local replacement might hinder a process,however,by not making available to it other,less used pages of memory.Thus global replacement generally results in greater system throughput and is therefore the more common method.
References
*Abraham Silberschatz, Peter Baer Galvin and Greg Gagne. "Operating System Principles", pp. 331, 348-353.
Wikimedia Foundation.
2010.
Look at other dictionaries:
Page replacement algorithm — This article is about algorithms specific to paging. For outline of general cache algorithms (e.g. processor, disk, database, web), see Cache algorithms. In a computer operating system that uses paging for virtual memory management, page… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Thrash (computer science) — In computer science, thrash (verb), is the term used to describe a degenerate situation on a computer where increasing resources are used to do a decreasing amount of work. In this situation the system is said to be thrashing . Usually it refers… … Wikipedia
Memoization — Not to be confused with Memorization. In computing, memoization is an optimization technique used primarily to speed up computer programs by having function calls avoid repeating the calculation of results for previously processed inputs.… … Wikipedia
LEON — is a computer CPU core, specifically, a 32 bit microprocessor based on RISC design. It is based on the SPARC V8 architecture, i.e., it is SPARC V8 (1987) instruction compatible, and originally designed by the European Space Research and… … Wikipedia
NRU — may refer to: National Reform Union (1864–1867), the formal name for the Reform Union, a minor, yet significant pressure group within the United Kingdom that demanded a secret ballot, extension of the franchise and equal sized constituencies in… … Wikipedia
Pirate decryption — most often refers to the reception of compromised pay TV or pay radio signals without authorization from the original broadcaster. The term pirate in this case is used in the sense of copyright infringement and has little or nothing to do with… … Wikipedia
Mathematics and Physical Sciences — ▪ 2003 Introduction Mathematics Mathematics in 2002 was marked by two discoveries in number theory. The first may have practical implications; the second satisfied a 150 year old curiosity. Computer scientist Manindra Agrawal of the… … Universalium
Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
C++0x — is the planned new standard for the C++ programming language. It is intended to replace the existing C++ standard, ISO/IEC 14882, which was published in 1998 and updated in 2003. These predecessors are informally known as C++98 and C++03. The new … Wikipedia
