Two algorithms are presented for implementing any of a class of buddy systems for dynamic storage allocation. Each buddy system corresponds to a set of recurrence relations which relate the block sizes provided to each other. Analyses of the internal fragmentation of the binary buddy system, the Fibonacci buddy system, and the weighted buddy system are given. Comparative simulation results are also presented for internal, external, and total fragmentation.
No takes yet. Share an insight, caveat, or question.
Peterson et al. (1977) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: