Page Replacement Algorithm - Local Vs. Global Replacement

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:

    Resorts advertised for waitresses, specifying that they “must appear in short clothes or no engagement.” Below a Gospel Guide column headed, “Where our Local Divines Will Hang Out Tomorrow,” was an account of spirited gun play at the Bon Ton. In Jeff Winney’s California Concert Hall, patrons “bucked the tiger” under the watchful eye of Kitty Crawhurst, popular “lady” gambler.
    —Administration in the State of Colo, U.S. public relief program (1935-1943)

    Much of what Mr. Wallace calls his global thinking is, no matter how you slice it, still “globaloney.” Mr. Wallace’s warp of sense and his woof of nonsense is very tricky cloth out of which to cut the pattern of a post-war world.
    Clare Boothe Luce (1903–1987)

    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)