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
FIFO page replacement This is the easiest page replacement algorithm. At this juncture the 1 st page entering is the 1 st to leave that is the oldest page leaves. To execute

Explain the OS/2 Operating System Like NetWare, OS/2 manage resources at three levels, as shown in Figure 4.5 Resources may be maintained at the session, process, and thread le

Suppose your process starts up, and allocates some memory with malloc(). The allocator will then give part of a memory page to your process. The OS then updates the corresponding p

VARIABLE PARTITIONING We can differ the partitions and change the location according to the size of the process. Here if a 10k process enters we are able to make a space of

Explain segmentation hardware? We define an completion to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means

Transferring files from Windows to Unix Be very careful transferring files from Windows to Unix. If you do transfer a file from Windows to Unix open the file, in Unix, using vi

Grouping Threads That Execute Similar Functions   Thread Groups are generally used to group threads that execute similar functions of the application program. For instance, if

Problem 1. List out the conditions that result in Deadlock situations. Illustrate deadlock situation with a simple graphical notation Listing conditions for deadlock occu

Define semaphore A semaphore is a protected abstract or variable data type that constitutes the classic method for restricting access to shared resources like shared memory in

Swapping : Whole process is moved from the swap machine to the main memory for execution. Process size must be equal or less than to the used main memory. It is easier to exe