Placement algorithm - process allocation, Computer Engineering

Placement algorithm - computer architecture:

Different strategies can be taken as to how space is allocated to processes:

  • First fit: Allocate the first hole that is large enough. Searching may begin either at the starting of the set of holes or where the previous first-fit search ended.
  • Best fit: Allocate the shortest hole that is large enough. The whole list of holes must be searched unless it is sorted by size. This strategy generated the smallest leftover hole.
  • Worst fit: Allocate the biggest hole. On the contrary, this strategy aims to generate the largest leftover hole, which can be large enough to hold another process. Experiments have shown that first fit and best fit both are better than worst fit in terms of storage utilization and decreasing time

341_Placement algorithm.png

Posted Date: 10/13/2012 5:52:31 AM | Location : United States







Related Discussions:- Placement algorithm - process allocation, Assignment Help, Ask Question on Placement algorithm - process allocation, Get Answer, Expert's Help, Placement algorithm - process allocation Discussions

Write discussion on Placement algorithm - process allocation
Your posts are moderated
Related Questions
Q. What do you mean by Software Poll? In this scheme on occurrence of an interrupt, processor jumps to an interrupt service program or routine whose job is to poll (roll call

Assume you own your own small party supply and rental business. You keep an Excel list of potential customers and clients who have rented or purchased from you in the past 2 years.

Write short note on Quantization. Quantization: This is the first step in PCM. The whole amplitude range of the modulating signal is divided in a number of standard levels term

what is inheritence and all types in java?

Granularity In parallel computing, granularity is a important measure of the ratio of computation to communication. Coarse Granularity: relatively huge amounts of computa

Internal Path length It is described as the number of node traversed while moving by one particular node to any other node in the tree.

Describe the advantages of JAVA servlets over CGI interface. The Advantage of Servlets Over "Tradi tional" CGI: Java servlets are extra efficient, easier to utilize more pow

Heuristic Search Strategies: Generally speaking that, a heuristic search is one which have uses a rule of thumb to improve an agent's performance in solving the problems via s

Q. Develop  a menu driven program to implement AND, OR, NOT gates using and without using  Bit wise operator. The menu  should  be  as follows: I.  Using Bit Wise operator I

Q. Execute a reduce operation over members of specified group? int info = pvm_reduce( void (*func)(), void *data, int count, int datatype, int msgtag, char    *group, int root