What are placement and replacement algorithms, Operating System

Placement algorithms:calculate where in available real-memory to execute a program. Common functions are next-fit, first-fit, and best-fit.

Replacement algorithms:are needed when memory is almost full, and one program requires to be swapped out to accommodate a new process. The replacement algorithm calculates which the partitions to be swapped out are.

Posted Date: 8/20/2012 3:41:51 AM | Location : United States







Related Discussions:- What are placement and replacement algorithms, Assignment Help, Ask Question on What are placement and replacement algorithms, Get Answer, Expert's Help, What are placement and replacement algorithms Discussions

Write discussion on What are placement and replacement algorithms
Your posts are moderated
Related Questions
What is the benefits OS co-operating process? Information sharing. Computation speeds up. Modularity. Convenience.

Q. In a ring-protection system the level 0 has the greatest access to objects and level n (greater than zero) has fewer access rights. The access rights of a program at a partic

Define the Non Monolithic Coding First off, client - server developers must adopt a new programming mindset. Much as with the shift to object - oriented design, developers sho

Many-to-One Model (Green Threads) Implementations of the many-to-one model a lot of user threads to one kernel thread permit the application to create any number of threads tha

Explain the Fork-join This is primitives in a higher level programming language for implementing interacting processes. The syntax is like this: fork ; join ; where

Q. State three merits of placing functionality in a device controller rather than in the kernel and State three disadvantages. Answer: Three advantages: Bugs are less probabl

Determine a processing that is not a part of Synthesis phase  Perform LC processing is not a part of Synthesis phase

Introduction of linux

What are the advantages of Indexed allocation? The benefits are a. No external-fragmentation problem b. Solves the size-declaration problems. c. Supports direct access

FCFS (First Come, First Served) Perform operations in order requested No reordering of work queue No starvation every demand is serviced Poor performance