Skip Navigation

The Computer Journal 1986 29(2):127-134; doi:10.1093/comjnl/29.2.127
© 1986 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pitman, N. M.
Right arrow Articles by Haddon, E. W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Buddy Systems with Selective Splitting

N. M. Pitman1 *, F. W. Burton2 § and E. W. Haddon * ¶

1 School of Computing Studies and Accountancy, University of East Anglia, Norwich, NR4 7TJ, UK, 2 Department of Electrical and Computer Engineering, University of Colorado at Denver, Denver, Colorado 80202, USA

A new approach to the buddy system for dynamic storage allocation is presented in which a block of a given size may be split in more than one way. It is demonstrated that this approach can be used to reduce the memory fragmentation of a buddy system.

Received April 1983.

* School of Computing Studies and Accountancy, University of East Anglia, Norwich, NR4 7TJ

§ Department of Electrical and Computer Engineering, University of Colorado at Denver, Denver, Colorado 80202, U.S.A.

To whom correspondence should be addressed.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.