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!
FIFO page replacement
This is the easiest page replacement algorithm. At this juncture the 1st page entering is the 1st to leave that is the oldest page leaves. To execute this we use a queue and the page at the head of the queue is the one being removed. The new page is put in at the tail of the queue. The disadvantage is that its performance isn't always good.
Example, Consider a three frame memory and if the sequence in which pages come into the memory is 1,2,3,4,1 then 1,2,3 are entered into the memory in order. While the page 4 is required then 1 is removed as well as the new page 4 is inserted at the tail end with the head being 2. Now if 1 comes then 2 is detached as it is the new head.
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
The optimal replacement policy, called OPT, is to evict the page which will be accessed farthest into the future. Since we can't predict the future precisely, we can't implement OP
Give a brief introduction about the operation of your program and show that you understand the idea behind threads and mutual exclusion variable. Why do we need to use mutual exclu
Develop a utility in C language which will run in Linux operating systems to display following properties of the system: ? Processor speed ? Ram size ? Computer name ? System time
Locks (also known as mutexes, short for mutual exclusion locks) provide mutual exclusion to shared data inside a critical session. They are implemented by means of two atomic routi
Can a direct access file be read sequentially? Explain. Yes. Keep a counter, cp, initially set to 0. After reading record cp, increment cp.
why we say" OS is a resource allocator" and “OS is a control program"?
Demand paging gives that pages could only be brought into memory if the running process acts them. This is usually referred to as lazy evaluation as only those pages operated by
Demonstrate that your program (include the program output as part of the final report) can produce the correct output with the following parameters. For each case comment if the ou
How is process management done in multiprocessing systems ? There are two accost for the process management in multiprocessor systems. Master-slave configuration Sy
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