Describe the following allocation algorithms:

a. First fit

b. Best fit

c. Worst fit

 

a. First-fit: search the list of available memory and allocate the first block that is big enough.

b. Best-fit: search the whole list of available memory and allocate the smallest block that is big enough.

c. Worst-fit: search the whole list of available memory and allocate the largest block.

 

Posted Date: 6/6/2013 6:24:13 AM | Location : United States

Ask an Expert

Related Discussions:- Explain first fit allocation algorithm, Assignment Help, Ask Question on Explain first fit allocation algorithm, Get Answer, Expert's Help, Explain first fit allocation algorithm Discussions

Write discussion on Explain first fit allocation algorithm
Your posts are moderated

Write your message here..

Related Questions

Comparison of disk scheduling algorithms, COMPARISON OF DISK SCHEDULING ALG... COMPARISON OF DISK SCHEDULING ALGORITHMS Name      Description                  Remarks      (Selection according to requestor)   RSS        Random scheduling     fo

What is a sequential file, What is a sequential file? A file that is re... What is a sequential file? A file that is read one record or block or parameter at a time in order, based on a tape model of a file.

Android operating system, Android operating system is an open source, Linux... Android operating system is an open source, Linux-based Smartphone OS. It is the world's most popular mobile platform with more than 700,000 applications and 25 billion downlo

Write a short note about the different states of a process, Write a short n... Write a short note about the different STATES of a process. As a process implement it changes state. The state of a process is described in part by the current activity of that

Linear programming problem, A paper mill produces two grades of paper viz.,... A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 ton

Explain lru additional reference bits algorithm, Additional Reference bits... Additional Reference bits algorithm Here we keep an 8-bit byte for every page in memory. At standard intervals the reference bit is shifted by the OS. If a shift register conta

Write a short note about context switch, Write a short note about context s... Write a short note about context switch. Switching the CPU to another process needs saving the state of the old process and loading the saved state for the new process. This ta

What is critical section?, What is critical section? Every process has ... What is critical section? Every process has a segment code called the critical section, in which the process may be updating tables, changing variables, writing file and etc. W

Command line interface, College life is tough.  Eating pizza for every meal... College life is tough.  Eating pizza for every meal is hitting you hard.  You are looking at working out to stay healthy.  You found a web site that tells you how many calories eac

Define buffering, Define buffering. A buffer is a memory area that keep... Define buffering. A buffer is a memory area that keeps data whereas they are transferred among two devices or among a device and an application. Buffering is done for three rea