Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
what are the disadvantages of swapping technique used in pre-3bsd unix systems if there is excessively much memory contention processes are swapped
the drawbacks of fixed partitioning are the number of partitions are preacutecised at system generation time limits the number of active processes in
explain fixed partitioningpartitioning are the simpler techniques that dont involve virtual memory partitioning has been used in numerous variations
in fixed portioning scheme what are the advantages of using unequal- size partitionswith unequal-size partitions there are two probable ways to
why is it not possible to enforce memory protection at compile time every process should be protected against unwanted interference by other
normal 0 false false false en-us x-none x-none microsoftinternetexplorer4
define memory managementin multiprogramming system the user part of memory should be further subdivided to accommodate multiple processes the task of
segmentationin a memory management system that is properly a programmer views a program to be collection of program components called as segments
write a brief note on demand paginga demand paging is alike to a paging system with swapping the processes reside on the secondary memory while we
what is the hardware support required to implement pagingeach operating system has its own techniques for storing page tables the majority allocates
the different paging techniques are1 multilevel paging or hierarchical paging method in definite cases the page table may consist up to 1 million
what is paging paging is a memory management scheme that authorizes the physical-address space of a process to be noncontiguous paging evades the
lru approximation page replacement in this we are able to use the reference bit associated with the page entry to choose a page to be removed the
lru page replacementin slightest recently used page replacement algorithm we will replace that page that hasnt been used for the longest period of
optimal page replacementan optimal page replacement algorithm has the least page fault rate of all algorithms the algorithm states that a replace the
fifo page replacementthis is the easiest page replacement algorithm at this juncture the 1st page entering is the 1st to leave that is the oldest
what are the hardware and software requirements for virtual memorythe hardware required for virtual memory is a secondary memory and page table the
what is page fault and what are the steps taken by the os to remove page faulta page fault is caused while a page that hasnt been brought into memory
what is meant by demand paging explaindemand paging is a technique to implement virtual memory in demand paging simply when a page is required it is
variable partitioningwe can differ the partitions and change the location according to the size of the processhere if a 10k process enters we are
fixed partitioning in a fixed partitioning the operating system inhabiting some fixed portion of main memory is available for use of multiple
what are over laysif a large process enters which is huge than the available memory we are able to use overlays in this we can divide process into
what is external fragmentationas process are removed from and loaded to the memory free memory space is bracken into pieces external fragmentation
what is internal fragmentationconsider holes of 20k assume the process requests 18 bites if we allocate accurately the request block we are left with
quick fit algorithamshere we keep apart lists for holes and processes therefore this reduces the searching time for holeshole list and process list