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
Explain about file allocation methods? The main problem in direct-access nature is how to assign space to these files so that disk space if utilized effectively and files can b

From hardware perspective, every information system can be divided into three task areas Presentation, Application Logic and Data Storage. The R/3 Basis software is extremely s

Transparency : Users must be able to access remote resources as though these resources were local. Transparency should as well promote user mobility. Users must be allowed to lo

properies of Batch oriented and interactive operating system.

with the aid of diagrams describe the following os structures monolithic , layered, client server

Question 1 Explain with diagram all possible states a process visits during the course of its execution Question 2 Discuss Inter-process Communication. What is critical-secti

What is meant by file management systems? File Management systems are as well referred to as simply a file system .File system is the system that an OS operating system or prog

Q. What is the basic function of Assembler ? Input to an assembler is an assembly language program. Output is an object program and information which enables the loader to prep

Internal file structure All disk I/O is performed in units of single block, and all blocks are the similar size. It is unlikely that the physical record size will exactly match

Central to implementation of a modern memory management system is the page replacement algorithm. Modern virtual memory systems break memory up into pages and map (via a page table