Local Vs. Global Replacement
Replacement algorithms can be local or global.
When a process incurs a page fault, a local page replacement algorithm selects for replacement some page that belongs to that same process (or a group of processes sharing a memory partition). A global replacement algorithm is free to select any page in memory.
Local page replacement assumes some form of memory partitioning that determines how many pages are to be assigned to a given process or a group of processes. Most popular forms of partitioning are fixed partitioning and balanced set algorithms based on the working set model. The advantage of local page replacement is its scalability: each process can handle its page faults independently without contending for some shared global data structure.
Read more about this topic: Page Replacement Algorithm
Famous quotes containing the words local, global and/or replacement:
“Wags try to invent new stories to tell about the legislature, and end by telling the old one about the senator who explained his unaccustomed possession of a large roll of bills by saying that someone pushed it over the transom while he slept. The expression “It came over the transom,” to explain any unusual good fortune, is part of local folklore.”
—For the State of Montana, U.S. public relief program (1935-1943)
“As the global expansion of Indian and Chinese restaurants suggests, xenophobia is directed against foreign people, not foreign cultural imports.”
—Eric J. Hobsbawm (b. 1917)
“Not even the visionary or mystical experience ever lasts very long. It is for art to capture that experience, to offer it to, in the case of literature, its readers; to be, for a secular, materialist culture, some sort of replacement for what the love of god offers in the world of faith.”
—Salman Rushdie (b. 1947)