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.
How are file sharing and protection implemented? To execute file sharing and protection the system have to maintain more file and directory attributes than are needed on a sing
General graph directory The serious problem with using an acyclic-graph structure is ensuring that there are no cycles. When we insert links to an existing tree-structured dire
Why interrupt can be used? The majority of the different parts of the PC need to send information to and from the processor and they expect to be able to get the processor's at
how it is work.
I need help,i want a brief and easy explanation to understand and write in exams and easy to understand topic of DMA block diagram which Is of I/O management and scheduling? can u
draw a state diagram showing the transissions of a process from creation to termination
What is the resident set and working set of a process? Resident set is that portion of the process image that is actually in real-memory at a certain instant. Working set is th
Ask question #Minimum 100 difference between bounded and unbounded buffer words accepted#
Banker's Algorithm In this analogy Customers ≡ processes Units ≡ resources, say, tape drive Ba
Q. Several CPUs provide for more than two modes of operation. What are two probable uses of these multiple modes? Answer: Although most systems merely distinguish between use
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