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!
LRU page replacement
In least lately used page replacement algorithm we will replace that page that hasn't been used for the longest period of time. This is similar as an optimal page replacement algorithm looking backward in time. It is considered as a good performer.
There are two methods for execution that are counter and stack. Counter is the easiest to execute in which with each page entry there is a counter or logical clock. For every memory reference it is incremented. We reinstate the page with the smallest time value. In this overflow should be considered, in stack memory allocation when a page is referenced it is removed from the stack and put on top. For the reason that the entries may be in middle it is implemented using doubly linked list.
Example Consider the string 1,2,3,4,3,2,1. In this 1, 2, 3 are inserted as normal as 4 comes it is entered in the position of 1. When 1 comes again 4 is put back as it is the least referenced.
Define busy waiting and spinlock. When a process is in its significant section, any other process that tries to enter its critical section must loop continuously in the entry c
Evicting the most-recently used (MRU) page does very well on LRU's worst case. In general, however, MRU is a bad idea, since many programs exhibit temporal locality in their memory
difference between soft link and hard links
Define buffering. A buffer is a memory area that keeps data whereas they are transferred among two devices or among a device and an application. Buffering is done for three rea
examples of classification of models
FCFS (First Come, First Served) Perform operations in order requested No reordering of work queue No starvation every demand is serviced Poor performance
Optimal page replacement An optimal page replacement algorithm has the least page fault rate of all algorithms. The algorithm states that put back the page that will not be us
Explain the Peterson's solution for the critical section problem? In Peterson's solution two variables a) flag and b) turn are used as shared variables. If the both shared vari
Q. The accelerating search for described in subsequent exercise is typical of hard-disk drives. By contrast floppy disks and several hard disks manufactured before the mid-1980s t
explain hierarchical,hashed and inverted paging
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