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
Question 1: (a) Discuss about the evolution of operating systems from mainframe batch systems to mainframe time sharing systems. (b) Explain your understanding of the "sus

What is reference string We evaluate an algorithm by running it on a definite string of memory reference and computing the number of page faults. The string of memory reference

Discuss the high barriers to entry in the market for PL operating systems

What advantages are there to this two-level directory? Users are isolated from each other. Users have more freedom in choosing file names.

what is secondary storage management

What is parsing Parsing is the procedure of analyzing a text, made of a sequence of tokens, to define its grammatical structure regarding to a given formal grammar. Parsing is

In this project, you will implement the Chandy and Misra's (CM) algorithm using POSIX Threads (Pthreads).   The algorithm  is a distributed algorithm to solve a generalized dining

A practical task specified in the Study Guide, Computer architecture, was to record your computer's specifications. Submit the data you recorded, which will contain the following d

What is real time system? A real time system has well explained, fixed time constraints. Processing must be done within the explained constraints, or the system will fail. It i

What are the requirements for solution of critical section problems? Mutual exclusion : If process p is implementing in its critical section then no other processes can be exe