Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Q. Segmentation is alike to paging but uses variable-sized "pages". Describe two segment-replacement algorithms based on FIFO and LRU page replacement schemes. Remember that since segments aren't the same size the segment that is chosen to be replaced mayn't be big enough to leave enough consecutive locations for the needed segment. Consider tactics for systems where segments cannot be relocated and those for systems where they can.
Answer:
a. FIFO. Find the first segment large sufficient to accommodate the incoming segment. If relocation isn't possible and no one segment is large enough select a combination of segments whose memories are contiguous which are closest to the first of the list and which are able to accommodate the new segment. If relocation is probable rearrange the memory so that the first N segments large sufficient for the incoming segment are contiguous in memory. Add any leftover space to the free-space list in both cases.
b. LRU. Select the segment that hasn't been used for the longest period of time and that is large enough adding any leftover space to the free space list. If no one segment is large sufficient select a combination of the oldest segments that are contiguous in memory (if relocation isn't available) as well as that are large enough.
If relocation is obtainable rearrange the oldest N segments to be contiguous in memory as well as replace those with the new segment.
Define Ageing Ageing is a method of enhancing the priority of process waiting in Queue for CPU allocation
Thermostats are subjected to rigorous testing before they are shipped to air conditioning technicians around the world. Results from the last five samples are shown in the table. D
What is sector sparing is proper definition
Question 1 Explain the structure of operating system in detail Question 2 Explain the following scheduling algorithm 1) First come Firs
Explain about demand paging? A demand paging system is same to a paging system with swapping. Processes reside on secondary memory. When we require executing a process, we chan
Q. You have devised a fresh page-replacement algorithm that you think may be optimal. In a few contorted test cases Belady's anomaly occurs. Is the fresh algorithm optimal? Descr
Q. How could a system be designed to allow a choice of operating systems to boot from? What would the bootstrap program need to do? Answer: Delieve a system that would like to
Explain about threading issues? The fork and exec system calls In a multithreaded program of few UNIX systems have chosen to have two versions of fork, one that duplicates e
Explain the Network protocols There are a wide variety of network protocols to choose from traditionally client - server developers were required to choose a communications pro
What components of the R/e system initiate the start of background jobs at the specified time? The batch scheduler initiates the begin of background job. The dispatcher then s
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd