Memory Management
A memory management technique where entire process are located together in physical memory
What is contiguous memory (allocation)?
An evenly divided portion of virtual memory
What is a page?
A file system with blocks containing pointers to the next block.
What is a linked file system?
The reason you would run the Banker's Algorithm
What is determing if a system is in a safe state to avoid deadlocks
This hardware device sends electrical signals and can buffer data
What is the device controller?
A method of finding free space in physical memory that causes the most external fragmentation
What is Worst Fit?
An evenly divided portion of physical memory
What is a page frame?
A method of storing file metadata outside of a directory entry
What is a linked File Control Block?
This algorithm determines if a process can utilize a requested resource
What is the Resource Request Algorithm?
This software provides APIs to the operating system to interact with hardware
What is a device driver?
A method of finding free space in physical memory utilizes the most processing resources
What is best fit (or worst fit)
This type of fragmentation is common with large page sizes
What is internal fragmentation?
The method a File Allocation Table file system utilizes to store file block information
What is a Master File Table?
The two conditions why a resource request would not be granted without running the safety alorithm
What is not enough available resources and more than the process's maximum resources?
This hardware device allows the CPU to service other processes while data is moved from a hardware device to physical memory
What is the Direct Memory Access (DMA) controller?
This memory space may be larger than physical memory
What is logical (or virtual memory)?
There are 4096 pages, 512 page frames, and 4096 bits within a page frame. This is how many bits are in the logical address.
What is 24 bits?
The number of file blocks in an i-node file system that can be accessed without an extra hard drive read.
What is 10 blocks?
This is the type of algorithm the Banker's Algorithm would be considered
What is continuous deadlock prevention?
This method of I/O processing is more efficient for slow I/O devices
What is I/O programming with interrupts?
This method of memory management utilizes registers to convert a logical memory address to a physical memory address
What is dynamic relocation?
Physical memory contains 1024 page frames and logical memory contains 128 pages. A page is 2048 bits. This many bits are in the page table if there are no administrative bits.
What is 1280 bits?
The number of file system operations required to add three blocks to a file that already contains 4 blocks. The file system is linked. Assuming the File Control Block is already loaded to memory.
What is 7 file operations?
This algorithm can identify deadlocks visually with a cycle
What is the Wait For algorithm?
This hard disk scheduling algorithm will locate the disk sector (or block) closest to the disk head's current position
What is Shortest Seek Time First (SSTF)?