Save
Upgrade to remove ads
Busy. Please wait.
Log in with Clever
or
show password
Forgot Password?
Don't have an account?  Sign up 
Sign up using Clever
or
Username is available taken
show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account. Your email address is only used to allow you to reset your password. See our Privacy Policy and Terms of Service.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.
focusNode
Didn't know it?
click below
 
Knew it?
click below
Don't Know
Remaining cards (0)
Know
0:00
edit
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

OS Mod 4

QuestionAnswer
The memory management strategy goal that aims to keep many processes in memory simultaneously Multiprogramming
A technique that allows the execution of processes that may not be completely in memory, abstracting main memory into an extremely large, uniform array of storage Virtual Memory
The type of memory as viewed by the user, which is separated from physical memory by the virtual memory system Logical Memory
A system similar to a paging system with swapping, where the OS swaps only the necessary pages into memory instead of the entire process Demand-paging
The concept or nickname for swapping only the necessary pages into memory rather than the entire process Lazy swapping
An additional bit in the page table set to indicate whether a corresponding page is in physical memory or in secondary storage Valid-invalid bit
The event that occurs and causes a trap to the operating system if a process tries to use a page that is not currently in physical memory Page-fault
The extreme case of demand paging where a system starts executing a process with no pages in memory, faulting immediately for the first instruction Pure demand paging
A property of computer programs where most execution time is spent on routines (like loops) in which many instructions are executed repeatedly, ensuring the page-fault rate remains low Locality of reference
The state of memory when there is a need to transfer a page from the disk to memory but there are no free frames available Over-allocated memory
The scheme where the operating system removes one of the existing pages in memory to give way for an incoming page Page replacement
The specific page selected by a replacement algorithm to be removed from physical memory and swapped out to the disk Victim page
An extra bit necessary for each page or frame that is set whenever any word or byte is written into, indicating the page has been changed and reducing the overhead of swapping Modify bit (or Dirty bit)
One of the major implementation problems dealing with how many frames the operating system will give to a process Frame Allocation
The string of memory references used to evaluate the performance and compute the number of page faults of a given page-replacement algorithm Reference string
The simplest page-replacement algorithm that always chooses the oldest page in the queue when a page must be replaced First-In First-Out (FIFO) Algorithm
A specific situation where the page-fault rate may actually increase as the number of physical memory frames increases Belady's Anomaly
The page-replacement algorithm that produces the lowest page-fault rate by replacing the page that will not be used for the longest period of time Optimal Algorithm
The page-replacement algorithm that uses the recent past to approximate the near future, replacing the page that has not been used for the longest period of time Least Recently Used (LRU) Algorithm
Created by: user-1931754
 

 



Voices

Use these flashcards to help memorize information. Look at the large card and try to recall what is on the other side. Then click the card to flip it. If you knew the answer, click the green Know box. Otherwise, click the red Don't know box.

When you've placed seven or more cards in the Don't know box, click "retry" to try those cards again.

If you've accidentally put the card in the wrong box, just click on the card to take it out of the box.

You can also use your keyboard to move the cards as follows:

If you are logged in to your account, this website will remember which cards you know and don't know so that they are in the same box the next time you log in.

When you need a break, try one of the other activities listed below the flashcards like Matching, Snowman, or Hungry Bug. Although it may feel like you're playing a game, your brain is still making more connections with the information to help you out.

To see how well you know the information, try the Quiz or Test activity.

Pass complete!
"Know" box contains:
Time elapsed:
Retries:
restart all cards