an algorithm used by virtual memory systems to

decide which page or segment to remove from main

memory when a page frame is needed and memory page replacement policy
is full

also called a "subprogram," a segment of a program

that can perform a specific function; subroutines can
reduce programming time when a specific function is subroutine
required at more than one point in a program

a behavior observed in many executing programs in

which recently referenced memory locations, and the
locations near them, are likely to be referenced in the locality of reference
near future

a code that can be used by two or more processes

at the same time; each shares the same copy of the reentrant code
executable code but has separate data areas

a collection of pages to be kept in main

memory for each active process in a working set
virtual memory environment

a division in a magnetic disk's track, sometimes

called a block; the tracks are divided into sectors
sectors during the formatting process

the elapsed time between two ticks

of the computer's system clock
clock cycle

a fixed-size section of a user's job that

corresponds in size to the page frames page
in main memory

in a paged or segmented memory allocation

environment, the difference between a page's
relative address and the actual machine language displacement
address; also called offset

an individual section of main memory of uniform

size into which a single page may be loaded page frame
without causing external fragmentation
a mathematical calculation that finds the remainder resulting

modulo operation
from the (Euclidean) division of one number by another; it's
always a positive integer; for example, the result of 11 modulo 3
= 2, because after dividing 11 by 3 the remainder is 2

a memory allocation scheme based on the concept

of dividing a user's job into logical groupings of code segmented/demand paged
and loading them into memory as needed to
minimize fragmentation memory allocation

a memory allocation scheme based on the concept

of dividing a user's job into logical groupings of code
in order to allow for noncontiguous program storage segmented memory allocation
during execution

a memory allocation scheme based on the concept

of dividing a user's job into sections of equal size in
order to allow for noncontiguous program storage paged memory allocation
during execution

a memory allocation scheme that loads

a program's page into memory at the demand paging
time it is needed for processing

the name given to several registers, allocated to

each active process, whose contents associate
several of the process segments and page numbers associative memory
with their main memory addresses

a page replacement policy that removes

least recently used (LRU)
from main memory the pages that show
the least amount of recent activity policy

a page replacement policy that removes

from main memory the pages that were first-in first-out (FIFO) policy
first brought in

the part of the Memory Manager that determines if there are

empty page frames in memory so that the requested page can
be immediately copied from secondary storage; it also
determines which page must be swapped out if all page frames
page fault handler
are busy

a phenomenon in a virtual memory system where an

excessive amount of page swapping back and forth
between main memory and secondary storage thrashing
results in higher overhead and little useful work
the process of changing the address of an
instruction or data item to the address in main
memory to where it is to be loaded or address resolution
relocated

the process of moving a page out of main memory

and into secondary storage so that another page page swapping
can be moved into memory in its place

a small, fast memory used to hold

selected data and to provide fast access
cache memory

a table in main memory that contains an

entry for each page frame, containing the Memory Map Table (MMT)
location and free/busy status for each one

a table in main memory that contains two values for

each active job—the size of the job, and the memory Job Table (JT)
location where its Page Map Table is stored

a table in main memory with the vital information

for each page, including the page number and Page Map Table (PMT)
its corresponding page frame memory address

a table in main memory with the vital information

for each segment, including the segment number Segment Map Table (SMT)
and its corresponding memory address

a technique that allows programs to be

executed even though they are not virtual memory
stored entirely in memory

a type of hardware interrupt caused by a reference to a page

that is not residing in memory when it is called; the resulting
effect is the movement of a page out of main memory into
secondary storage, so that the called page can be moved into
page fault
memory

an unusual circumstance through which adding more

page frames causes an increase in page interrupts
FIFO anomaly or the Belady
when using a FIFO page replacement policy Anomaly
 a variable-sized section of a user's job
that contains a logical grouping of code
segment

a variation of the LRU policy that removes from

main memory the pages that show the least
clock page replacement
amount of activity during recent clock cycles policy