论文信息 - A note on weighted buddy systems for dynamic storage allocation

A note on weighted buddy systems for dynamic storage allocation

In this paper we first show that the Shen and Peterson System [1] is a combination of two Fibonacci buddy systems [2, 3]. Then we present a generalized Shen and Peterson system. The generalized system has more flexibility in the generation of fixed size blocks. For the generalized system, the algorithm for the determination of the buddy of any released block is easier than that of the Shen and Peterson system.

Harry T. Hsu

[1] Kenneth C. Knowlton,et al. A fast storage allocator , 1965, CACM.

[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[3] James A. Hinds. An algorithm for locating adjacent storage blocks in the buddy system , 1975, CACM.

[4] James L. Peterson,et al. A weighted buddy method for dynamic storage allocation , 1974, CACM.

[5] Lawrence W. Frederick. Remark on Algorithm 475. , 1975 .

[6] Daniel S. Hirschberg,et al. A class of dynamic memory allocation algorithms , 1973, CACM.

[7] Kenneth C. Knowlton. A programmer's description of L6 , 1966, CACM.