Worst case performance of weighted buddy systems (Q1085608)

In this paper the authors have studied the worst case performance of the weighted buddy system of memory management. Specifically they have derived lower bounds of two system parameters NETREQ and NETALLOC (these two parameters completely characterize both external and internal fragmentation in the system for any memory management scheme) for a weighted buddy system in case of unrestricted request sequence and stated a few preliminary results for those parameters in case of allocation only request sequence. They have also given bounds for the same system parameters for exact-fit memory manamegent algorithms to compare the results with those for buddy systems.