Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ucbvax!CS.PURDUE.EDU!comer
From: comer@CS.PURDUE.EDU (Douglas Comer)
Newsgroups: comp.os.xinu
Subject: Re:  Memory Management using Buddy Alg. HELP!
Message-ID: <8904251420.AA11961@merlin.cs.purdue.edu>
Date: 25 Apr 89 14:20:15 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The Internet
Lines: 17

Adrian,

   The buddy algorithm is documented in Knuth, Art of Computer
Programming, but I'm not sure what you expect to improve.  Do you
have a reason to believe that in your system requests for memory
will always be exactly (or just less than) powers of 2 in size?  Do
you have fragmentation problems now?  Also, do you understand that
the non-virtual memory system carefully separates stack and heap
allocation in an attempt to keep persistent memory allocation separate
from stack allocation?

   I suggest that you read knuth's discussion of various memory
management tecniques and some of the subsequent papers before you
jump into coding.

Cheers,
Doug