Linux的伙伴算法把所有的空闲页面分为10个块组，每组中块的大小是2的幂次方个页面，例如，第0组中块的大小都为20 （1个页面），第1组中块的大小为都为21（2个页面），第9组中块的大小都为29（512个页面）。也就是说，每一组中块的大小是相同的，且这同样大小的块形成一个链表-Linux partners algorithm all the free page is divided into 10 blocks of groups, each group in the block size is two power-of-pages, for example, the first group in the 0 block size is 20 (one page), the first a block size of the group are 21 (2 pages), 9 blocks the size of the group are 29 (512 pages). In other words, each group in the block size is the same, and the same size to form a linked list of blocks