Kim Kwan Joong, Kim Byung Gi

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 6, pp. 1625-1635, Jun. 1997
10.3745/KIPSTE.1997.4.6.1625,   PDF Download:

Abstract

An extension of the weighted buddy system, called the extended-weighted buddy system, for dynamic memory allocation in an object-oriented computer is presented. The extended-weighted buddy system allows block sizes of 2^k, 3*2^k, 5*2^k, 7*2^k, whereas the original weighted buddy system allowed block sizes of 2^k and 3*2^k. This extension is achieved at only the cost of additional 3 bits per block for memory management unit.Simulation results are presented which compare our method with the weighted buddy system. These results indicate that, for uniform request distributions, our system has less internal memory fragmentation than the weighted buddy system(approximately 60%). And, for exponential request distributions, it has less internal memory fragmentation than the weighted buddy method (approximately 50%). The external fragmentation is greater for this system than the weighted buddy system. But, our system has less total memory fragmentation for exponential request distributions, and two systems take a similar total memory fragmentation for uniform request distributions, so we can substitutes the extended-weighted buddy system for weighted buddy system.

Statistics
Cite this article