Chapter 9: Virtual Memory: Al-Mansour University College Software Engineering and Information Technology Department
Chapter 9: Virtual Memory: Al-Mansour University College Software Engineering and Information Technology Department
week 9
CHAPTER 9: VIRTUAL MEMORY
3 Copy-on-Write
4 Page Replacement
5 Allocation of Frames
6 Thrashing
7 Memory-Mapped Files
8 Allocating
9 Other Considerations
10 Operating-System Examples
BACKGROUND
Code needs to be in memory to execute, but entire program rarely
used
Error code, unusual routines, large data structures
Entire program code not needed at same time
Consider ability to execute partially-loaded program
Program no longer constrained by limits of physical memory
Program and programs could be larger than physical memory
BACKGROUND
Virtual memory – separation of user logical memory from physical
memory
Only part of the program needs to be in memory for execution
Logical address space can therefore be much larger than physical address space
Allows address spaces to be shared by several processes
Allows for more efficient process creation
More programs running concurrently
Less I/O needed to load or swap processes
Lazy swapper – never swaps a page into memory unless page will be
needed
Swapper that deals with pages is a pager
TRANSFER OF A PAGED MEMORY TO
CONTIGUOUS DISK SPACE
VALID-INVALID BIT
With each page table entry a valid–invalid bit is associated
(v in-memory – memory resident, i not-in-memory)
Initially valid–invalid bit is set to i on all entries
Example of a page table snapshot:
Frame # valid-invalid bit
v
v
v
v
i
….
i
i
page table
During address translation, if valid–invalid bit in page table entry
is I page fault
PAGE TABLE WHEN SOME PAGES
ARE NOT IN MAIN MEMORY
PAGE FAULT
If there is a reference to a page, first reference to that page will
trap to operating system:
page fault
1. Operating system looks at another table to decide:
Invalid reference abort
Just not in memory
2. Get empty frame
3. Swap page into frame via scheduled disk operation
4. Reset tables to indicate page now in memory
Set validation bit = v
5. Restart the instruction that caused the page fault
ASPECTS OF DEMAND PAGING
Extreme case – start process with no pages in memory
OS sets instruction pointer to first instruction of process, non-memory-
resident -> page fault
And for every other process pages on first access
Pure demand paging
autoincrement/decrement location
Restart the whole operation?
What if source and destination overlap?
STEPS IN HANDLING A PAGE FAULT
PERFORMANCE OF DEMAND PAGING
Stages in Demand Paging
1. Trap to the operating system
2. Save the user registers and process state
3. Determine that the interrupt was a page fault
4. Check that the page reference was legal and determine the location of the page on the disk
5. Issue a read from the disk to a free frame:
1. Wait in a queue for this device until the read request is serviced
2. Wait for the device seek and/or latency time
3. Begin the transfer of the page to a free frame
6. While waiting, allocate the CPU to some other user
7. Receive an interrupt from the disk I/O subsystem (I/O completed)
8. Save the registers and process state for the other user
9. Determine that the interrupt was from the disk
10. Correct the page table and other tables to show page is now in memory
11. Wait for the CPU to be allocated to this process again
12. Restore the user registers, process state, and new page table, and then resume the interrupted instruction
PERFORMANCE OF DEMAND PAGING
(CONT.)
Page-replacement algorithm
Want lowest page-fault rate on both first access and re-access
1 7 2 4 0 7
2 0 3 2 1 0 15 page faults
Can vary by reference string: consider 1,2,3,4,1,2,5,1,2,3,4,5
3 1 0 3 2 1
Adding more frames can cause more page faults!
Belady’s Anomaly
Replace page that will not be used for longest period of time
9 is optimal for the example on the next slide
Stack implementation
Keep a stack of page numbers in a double link form:
Page referenced:
move it to the top
requires 6 pointers to be changed
But each update more expensive
No search for replacement
LRU and OPT are cases of stack algorithms that don’t have Belady’s
Anomaly
USE OF A STACK TO RECORD THE
MOST RECENT PAGE REFERENCES
LRU APPROXIMATION ALGORITHMS
LRU needs special hardware and still slow
Reference bit
With each page associate a bit, initially = 0
When page is referenced bit set to 1
Replace any with reference bit = 0 (if one exists)
We do not know the order, however
Second-chance algorithm
Generally FIFO, plus hardware-provided reference bit
Clock replacement
If page to be replaced has
Reference bit = 0 -> replace it
reference bit = 1 then:
set reference bit 0, leave page in memory
MFU Algorithm: based on the argument that the page with the
smallest count was probably just brought in and has yet to be used
PAGE-BUFFERING ALGORITHMS
Keep a pool of free frames, always
Then frame available when needed, not found at fault time
Read page into free frame and select victim to evict and add to free
pool
When convenient, evict victim
Operating system can given direct access to the disk, getting out
of the way of the applications
Raw disk mode
Bypasses buffering, locking, etc
ALLOCATION OF FRAMES
Many variations
FIXED ALLOCATION
PRIORITY ALLOCATION
Local replacement – each process selects from only its own set
of allocated frames
More consistent per-process performance
But possibly underutilized memory
NON-UNIFORM MEMORY ACCESS
So far all memory accessed equally
Many systems are NUMA – speed of access to memory varies
Consider system boards containing CPUs and memory, interconnected
over a system bus
Optimal performance comes from allocating memory “close to”
the CPU on which the thread is scheduled
And modifying the scheduler to schedule the thread on the same
system board when possible
Solved by Solaris by creating lgroups
Structure to track CPU / Memory low latency groups
Used my schedule and pager
When possible schedule all threads of a process and allocate all memory for that process within the lgroup
THRASHING
If a process does not have “enough” pages, the page-fault rate is
very high
Page fault to get page
Replace existing frame
But quickly need replaced frame back
This leads to:
Low CPU utilization
Operating system thinking that it needs to increase the degree of multiprogramming
Another process added to the system
Example: = 10,000
Timer interrupts after every 5000 time units
Keep in memory 2 bits for each page
Whenever a timer interrupts copy and sets the values of all reference bits to 0
If one of the bits in memory = 1 page in working set
Simplifies and speeds file access by driving file I/O through memory
rather than read() and write() system calls
Also allows several processes to map the same file allowing the pages in
memory to be shared
But when does written data make it to disk?
Periodically
and / or at file close() time
For example, when the pager scans for dirty pages
MEMORY-MAPPED FILE TECHNIQUE FOR ALL I/O
Some OSes uses memory mapped files for standard I/O
Process can explicitly request memory mapping a file via mmap()
system call
Now file mapped into process address space
For standard I/O (open(), read(), write(), close()),
mmap anyway
But map file into kernel address space
Process still does read() and write()
Copies data to and from kernel space and user space
Uses efficient memory management subsystem
Avoids needing separate subsystem
If slab is full of used objects, next object allocated from empty slab
If no empty slabs, new slab allocated
Benefits include no fragmentation, fast memory request
satisfaction
SLAB ALLOCATION
OTHER CONSIDERATIONS -- PREPAGING
Prepaging
To reduce the large number of page faults that occurs at process startup
Prepage all or some of the pages a process will need, before they are
referenced
But if prepaged pages are unused, I/O and memory was wasted
Assume s pages are prepaged and α of the pages is used
Is cost of s * α save pages faults > or < than the cost of prepaging
s * (1- α) unnecessary pages?
α near zero prepaging loses
OTHER ISSUES – PAGE SIZE
Sometimes OS designers have a choice
Especially if running on custom-built CPU
Page size selection must take into consideration:
Fragmentation
Page table size
Resolution
I/O overhead
Number of page faults
Locality
TLB size and effectiveness
Always power of 2, usually in the range 212 (4,096 bytes) to 222 (4,194,304
bytes)
On average, growing over time
OTHER ISSUES – TLB REACH
TLB Reach - The amount of memory accessible from the TLB
TLB Reach = (TLB Size) X (Page Size)
Ideally, the working set of each process is stored in the TLB
Otherwise there is a high degree of page faults
Program 2
for (i = 0; i < 128; i++)
for (j = 0; j < 128; j++)
data[i,j] = 0;
Consider I/O - Pages that are used for copying a file from a device
must be locked from being selected for eviction by a page
replacement algorithm
REASON WHY FRAMES USED FOR
I/O MUST BE IN MEMORY
OPERATING SYSTEM EXAMPLES
Windows XP
Solaris
WINDOWS XP
Uses demand paging with clustering. Clustering brings in pages
surrounding the faulting page
Processes are assigned working set minimum and working set
maximum
Working set minimum is the minimum number of pages the
process is guaranteed to have in memory
A process may be assigned as many pages up to its working set
maximum
When the amount of free memory in the system falls below a
threshold, automatic working set trimming is performed to
restore the amount of free memory
Working set trimming removes pages from processes that have
pages in excess of their working set minimum
SOLARIS
Maintains a list of free pages to assign faulting processes
Lotsfree – threshold parameter (amount of free memory) to begin
paging
Desfree – threshold parameter to increasing paging
Scanrate is the rate at which pages are scanned. This ranges from
slowscan to fastscan
Pageout is called more frequently depending upon the amount of
free memory available
Priority paging gives priority to process code pages
SOLARIS 2 PAGE SCANNER