Location of Repository

Segregated Binary Trees: Address-Ordered Binary Trees Revisited

By Krishna Kavi


Dynamic memory management has been an active research area for the last four decades. The primary goals of any memory management technique are the speed of allocation & delloaction; and efficient storage utilization. In this paper, we introduce two new memory allocation techniques: Address Ordered Binary Trees (ABT) and Segregated Binary Trees (SBT). Our empirical results show how Address Ordered and Segregated Binary Trees can outperform other mechanisms with respect to storage utilization. In addition, the Segregated Binary Trees compare favorably with Segregated Free List approaches in terms of execution time

Topics: Dynamic Memory Management, Garbage Collection, Memory Fragmentation, Address Ordered Binary Trees, Sequential Fit, Segregated Free List
Year: 2007
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://salid6.csci.unt.edu/~ka... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.