Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

Describe the Buddy system of memory allocation.

Answer Posted / wiki addict

The buddy memory allocation technique allocates memory in
powers of 2, i.e 2x, where x is an integer. Thus, the
programmer has to decide on, or to write code to obtain, the
upper limit of x. For instance, if the system had 2000K of
physical memory, the upper limit on x would be 10, since 210
(1024K) is the biggest allocatable block. This results in
making it impossible to allocate everything in as a single
chunk; the remaining 976K of memory would have to be taken
in smaller blocks.
After deciding on the upper limit (let's call the upper
limit u), the programmer has to decide on the lower limit,
i.e. the smallest memory block that can be allocated. This
lower limit is necessary so that the overhead of storing
used and free memory locations is minimized. If this lower
limit did not exist, and many programs request small blocks
of memory like 1K or 2K, the system would waste a lot of
space trying to remember which blocks are allocated and
unallocated. Typically this number would be a moderate
number (like 2, so that memory is allocated in 2² = 4K
blocks), small enough to minimize wasted space, but large
enough to avoid excessive overhead. Let's call this lower
limit l.
Now that we have our limits, let us see what happens when a
program makes requests for memory. Let's say in this system,
l = 6, which results in blocks 26 = 64K in size, and u = 10,
which results in a largest possible allocatable block, 210 =
1024K in size. The following shows a possible state of the
system after various memory requests.

Is This Answer Correct ?    5 Yes 3 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Does uninstalling a program delete it?

1120


How to recovery from deadlock?

1095


What are the different tasks of Lexical analysis?

2330


How is the total memory on a ram stick calculated?

1176


Does 64 bit require uefi bios?

1041


What are different tasks of lexical analysis?

1188


What is the cpu scheduler?

1080


What is context-switching in multi-threading?

1219


How does a memory leak work?

1025


What are the 4 stages of computing?

1077


What is synchronization? What are the different synchronization mechanisms?

1134


What is a socket?

1215


Define die threading and tapping.

1058


How many gb is an operating system?

1026


What are significance of semaphores?

1224