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.
Symmetric multiprocessing To get maximum reliability and efficiency a mode of function called as symmetric multiprocessing is used. In essence, with SMP any program or threads
Determine what the “blocking factor” of a file is Blocking factor is the number of logical records in one physical record
What is the purpose of the command interpreter? Why is it usually separate from the kernel? It reads commands from the user or from a file of commands and executes them, usuall
What is an operating system process? How is it different from a program? Why do we need the concept of a process, rather than simply talk about programs running in memory? The e
what are the threds in operating system?
function of lazy swapper
Q. Explain a mechanism by which one segment could belong to the address space of two different processes. Answer: Because segment tables are a collection of base-limit register
Forking is an important phase of Unix, critical to the support of its design strategies, which encourages the implementation of filters. In Unix, a filter is a process that reads i
how is it possible
Q. What resources are utilized when a thread is created? How do they vary from those used when a process is created? Answer: For the reason that a thread is smaller than a pr
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