Thumbnail
Access Restriction
Subscribed

Author Peterson, James L. ♦ Shen, Kenneth K.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Buddy system ♦ Weighted buddy algorithm ♦ Memory allocation ♦ Dynamic storage allocation
Abstract An extension of the buddy method, called the weighted buddy method, for dynamic storage allocation is presented. The weighted buddy method allows block sizes of 2k and 3·2k, whereas the original buddy method allowed only block sizes of 2k. This extension is achieved at an additional cost of only two bits per block.Simulation results are presented which compare this method with the buddy method. These results indicate that, for a uniform request distribution, the buddy system has less total memory fragmentation than the weighted buddy algorithm. However, the total fragmentation is smaller for the weighted buddy method when the requests are for exponentially distributed block sizes.
Description Affiliation: Stanford Univ., Stanford, CA (Shen, Kenneth K.; Peterson, James L.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 17
Issue Number 10
Page Count 5
Starting Page 558
Ending Page 562


Open content in new tab

   Open content in new tab
Source: ACM Digital Library