ResearchIndex Home J. L. Peterson and N. Theodore. This has the advantage of simplicity. It also avoids any complexity associated with choosing a node size. However, a single node size policy has the disadvantage of not adapting to the memory layout of the application, i.e. it could use more memory for a given tree depth than a scheme using a multiple size policy. J. L. Peterson and N. Theodore.
Job scheduling determines the order in which jobs are considered for processor allocation.
The Multiple Gray Code and MSS algorithms allow for perfect subcube . J. L. Peterson and T. A. Norman, Buddy Systems, Communications of ACM , vol. 421-431, June 1977. The policy is therefore a good fit or even a best fit policy, despite the fact that it s usually described as a variation on first fit. In the simple buddy schemes, the entire heap area is conceptually split into two large areas, and those areas are further split into two smaller areas, and so on.