On Mon, 22 Oct 2012 14:56:49 -0500, Roberts, John J wrote:
>>http://www-cs-faculty.stanford.edu/~uno/taocp.html#vol4
>
>I have an interesting story to tell regarding Volume 1 of The Art of Computer
>Programming. Buried within this tome is an algorithm for storage allocation
>and de-allocation. The whole idea is to allocate storage in chunks that are a
>power of 2 in length (32, 64, 128, etc.). Knuth calls this the "Buddy Storage
>Algorithm" since by knowing the address of a chunk, you know it's size. ...
>
Errr ??? I'm skeptical. Suppose the address is 0, relative to the base of
the managed storage pool. What's its size? Which is the buddy?
From DEK Vol. 1. 1969, p. 443:
... if we know the address of a block..., _and_if_we_also_we_know_the_size_
of_that_block_, we know the address of its buddy.
(Emphasis added.)
-- gil
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: INFO IBM-MAIN
