>From the article (thanks John), the magic is in "the "buddy" of each block can be found with an exclusive OR of the block's address and the block's size." Cool.
Chip From: "Roberts, John J" <[email protected]> To: [email protected] Date: 10/22/2012 03:22 PM Subject: Re: Donald Knuth and The Art of Computer Programming - was RE: Book Enquiry Sent by: IBM Mainframe Discussion List <[email protected]> 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? I may be a bit hazy on the details. See http://en.wikipedia.org/wiki/Buddy_memory_allocation for something a bit more accurate. What I am not hazy on is the performance boost we achieved by implementing a scheme with Knuth's algorithm at its core. It cut the path length of a CICS GETMAIN or FREEMAIN from 2000+ instructions down to about 250. And doubled the transactional capacity of our app. John ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: INFO IBM-MAIN ******* This message may contain confidential information intended only for the use of the addressee(s) named above and may contain information that is legally privileged. If you are not the addressee, or the person responsible for delivering it to the addressee, you are hereby notified that reading, disseminating, distributing or copying this message is strictly prohibited. If you have received this message by mistake, please immediately notify us by replying to the message and delete the original message immediately thereafter. Thank you. ******* ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: INFO IBM-MAIN
