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
FIXED PARTITIONING Using fixed partitioning we are able to allocate the memory Here we are dividing the memory into a few fixed partitions.Every partition may not be of the si

Q. Show the services which provided by operating system? A) Resource Allocation: If there are more than one user or jobs running at the same instance then resource

Q. Describe the purpose of the open() and close() operations. Answer: The open() operation notifies the system that the named file is about to become active. The c

What are scheduling queues? Since the processes enter the system they are put into job queue. This queue contains all processes in the system. The processes that are exist in m

Paging full question

A file system depends on data structures about the files, beside the file structure. The former is named metadata-data that defines data. Each file is accumulated with an inode, wh

Define dynamic loading. To obtain better memory-space utilization dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. All routines are ke

Define request edge and assignment edge. Answer:  A directed edge from process Pi to resource type R j is denoted by Pi->j; it signifies that process Pi requested an instance

Producer-Consumer Problem Using Semaphores The Solution to producer-consumer problem use three semaphores namely- full, empty and mutex. The semaphore 'full' is utilized for

What is critical section problem? Consider a system consists of 'n' processes. Every process has segment of code called a critical section, in which the process might be changi