Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
list the coffmans conditions that lead to a deadlockmutual exclusion only one process might be use a critical resource at a timehold amp wait a
what is thrashing it is a method in virtual memory schemes when the processor spends most of its time swapping pages rather than implementing
explain beladys anomalyalso called fifo anomaly usually on enhancing the number of frames allocated to a process virtual memory the process
explain the concept of reentrancyit is a useful memory-saving method for multiprogrammed timesharing systems a reentrant procedure is one in which
1 what must a kernel provide for an effective user-level thread implementation 2 with respect to the quantum q in a scheduling
explain segmentation hardwarewe define an completion to map two-dimensional user-defined addresses into one-dimensional physical addresses this
what is segmentationin a segmented memory management scheme a programmer views a program to be collection of program components called as segments
hashed page table methoda general approach for managing address spaces larger than 32 bits is to use a hashed page table with the hash values being
what is paging name the different paging techniquespaging is a memory management method that permits the physical-address space of a process to be
what lead to the concept of pagingthe main memory is separated into two parts that are one for the resident operating system and one for the user
additional reference bits algorithmhere we keep an 8-bit byte for every page in memory at standard intervals the reference bit is shifted by the os
enhanced second chance algorithmin this a modify bit is as well used now if the ordered pair of reference and modify is00 neither recently used nor
second chance algorithmwhen the page is chosen the reference bit is checked to see whether it has been referenced before if that is the case after
lru approximation page replacement in this we utilize the reference bit associated with the page entry to choose a page to be removed the various
lru page replacementin least lately used page replacement algorithm we will replace that page that hasnt been used for the longest period of time
optimal page replacementan optimal page replacement algorithm has the least page fault rate of all algorithms the algorithm states that put back the
fifo page replacementthis is the easiest page replacement algorithm here the 1st page toward the inside is the 1st to leave that is the oldest page
what is page faultin the computer storage technology a page fault is an exception which is raised by the memory management unit when a requested page
explain internal fragmentationthe internal fragmentation signifies to the result of reserving a piece of space without ever intending to use it this
explain external fragmentationexternal fragmentation is the process where the free space and the space still available for use in a piece of storage
define thrashingthrashing is the accident of high page traffic and low cpu utilization it is observed that the cause of thrashing is an
describe paging technique used in unix systemswhen a process begin in unix not every its memory pages are read in from the disk at once in its place
how is a process chosen for being swapped either in or out swap outa if the process is
describe swapping technique in unix systemsswapping is used to control memory contention among processes if there is excessively much memory