Description: Buddy (partners) each allocation algorithm contains a number of physical pages or blocks of memory, two pages to the Powers of the block of memory to allocate. First of all search requests to meet the size of pages, from the application to meet the current size of the data structure Buddy 8 freePages domain proceed along the chain to search leisure pages. If no such request size spare pages, which then search request twice the size of a memory block. This process has to continue until all the Buddy Search End or were found to meet the requirements for the memory block. If found in the pages block greater than the requested block is divided in its size and make it the request block matching. As pieces are the two Powers So segmentation process is very simple : free block (low-address) was e
File list (Check if you may need any files):
Download