Create an account
the process of changing the address of an instruction or data item to the address in main memory at which it is to be loaded or relocated
the name given to several register, allocated to each active process, whose contents associate several of the process segments and page numbers with their main memory addresses
a small, fast memory used to hold selected data and to provide faster access than would otherwiese be possible
clock page replacement policy
a variation of the LRU policy that removes from main memory the pages that show the least amount of activity during recent clock cycles
a memory allocation scheme that loads a program's page into memory at the time it is needed for processing
in a paged or segmented memory allocation environment, the difference between a page's relative address and the actual machine language address. Also called offset.
an unusual circumstance through which adding more page frames causes an increase in page interrupts when using a FIFO page replacement policy. Also known as Beady's anomaly
first-in first-out (FIFO) policy
a page replacement policy that removes from main memory the pages that were brought in first
job Table (JT)
a table in main memory that contains two values for each active job: the size of the job and the memory locaiton where its page map table is stored
least recently used (LRU) policy
a page-replacement policy that removes from main memory the pages that show the least amount of recent activity
locality of reference
behavior observed in many executing programs in which memory locations recently referenced, and those near them, are likely to be referenced in the near future
memory map table (MMT)
a table in main memory that contains as many entries as there are page frames and lists the location and free/busy status for each one
a type of hardware interrupt caused by a reference to a page not residing in memory. The effect is to move a page of main memory and into secondary storage so another page can be moved into memory
page fault handler
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, or determines which page must be swapped out if all page frames are busy. Also known as page interrupt handler.
an individual section of main memory of uniform size into which a single page may be loaded without causing external fragmentation
page map table (PMT)
a table in main memory with the vital information for each page including the page number and its corresponding page frame memory address
page replacement policy
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 is full
the process of moving a page out of main memory and into secondary storage so another page can be moved into memory in its place
paged memory allocation
a memory allocation scheme based on the concept of dividing a user's job into section of equal size ot allow for noncontiguous program storage during execution
code that can be used by two or more processes at the same time; each shares the same copy of the executable code but has separate data areas
a division in a disk's tack, sometimes called a "block." The tracks are divided into sectors during the formatting process
segment map table (SMT)
a table in main memory with the vital information for each segment including the segment number and its corresponding memory address
segmented/demand paged memory allocation
a memory allocaiton scheme based on the concept of dividing a user's job into logical groupings of code and loading them into memory as needed to minimize fragmentation
segmented memory allocation
a memory allocation scheme based on the concept of dividing a user's job into logical groupings of code to allow for noncontiguous program storage during execution
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 required at more than one point in a program
a phenomenon in a virtual memory system where an excessive amount of page swapping back and forth between main memory and secondary storage results in higher overhead and little useful work
a technique that allows programs to be executed even though they are not stored entirely in memory
Please allow access to your computer’s microphone to use Voice Recording.
Having trouble? Click here for help.
We can’t access your microphone!
Click the icon above to update your browser permissions and try again
Reload the page to try again!Reload
Press Cmd-0 to reset your zoom
Press Ctrl-0 to reset your zoom
It looks like your browser might be zoomed in or out. Your browser needs to be zoomed to a normal size to record audio.
Please upgrade Flash or install Chrome
to use Voice Recording.
For more help, see our troubleshooting page.
Your microphone is muted
For help fixing this issue, see this FAQ.
Star this term
You can study starred terms together