Basics 4 Flashcards
Main memory divided into a number of equal size frames is the __________ technique.
simple paging
With __________ a process is loaded by loading all of its segments into dynamic partitions that need not be contiguous.
simple segmentations
The chunks of a process are known as __________ .
pages
Available chunks of memory are known as ___________ .
frames
In the Dynamic Partitioning technique of memory management, the placement algorithm that chooses the block that is closest in size to the request is called __________ .
best-fit
In the Dynamic Partitioning technique of memory management, the placement algorithm that scans memory from the location of the last placement and chooses the next available block that is large enough to satisfy the request is called __________ .
next-fit
In a system employing a segmentation scheme for memory management a process is divided into _________ .
a number of segments which need not be of equal size
The task of subdividing memory to accommodate multiple processes is carried out dynamically by the operating system and is known as ___________ .
memory management
A __________ is a variable length block of data that resides in secondary memory.
segment
A __________ is an actual location in main memory.
physical address (or absolute address)
A fixed length block of data that resides in secondary memory is a __________ .
page
When there is wasted space internal to a partition due to the fact that the block of data loaded is smaller than the partition is referred to as __________.
internal fragmentation
_________ in a computer system is organized as a linear, or one-dimensional, address space, consisting of a sequence of bytes or words.
Main memory
A _________ is a fixed length block of main memory.
frame
As time goes on, memory becomes more and more fragmented and memory utilization declines, creating a phenomenon referred to as _________ .
external fragmentation
A __________ is a reference to a memory location independent of the current assignment of data to memory.
logical address
The __________ shows the frame location for each page of the process.
page table
The basic tools of memory management are paging and __________ .
segmentation
The address of a storage location in main memory is the __________ .
real address
A _________ is issued if a desired page is not in main memory.
page fault
The _________ determines when a page should be brought into main memory.
fetch policy
With _________ pages other than the one demanded by a page fault are brought in.
prepaging
The address assigned to a location in virtual memory to allow that location to be accessed as though it were part of main memory is the __________ .
virtual address
_________ is a storage allocation scheme in which secondary memory can be addressed as though it were part of main memory.
Virtual memory
The __________ policy treats the page frames allocated to a process as a circular buffer and pages are removed in round robin style.
first-in-first-out (FIFO)
When the system spends most of its time swapping pieces rather than executing instructions it leads to a condition known as _________ .
thrashing
To overcome the problem of doubling the memory access time, most virtual memory schemes make use of a special high-speed cache for page table entries called a __________ .
translation lookaside buffer (TLB)
With __________ , a page is brought into main memory only when a reference is made to a location on that page.
demand paging
The __________ policy replaces the page in memory that has not been referenced for the longest time.
least recently used (LRU)
