Segregated Binary Trees: Address-Ordered Binary Trees Revisited

  • Published 2000

Abstract

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.

20 Figures and Tables

Cite this paper

@inproceedings{2000SegregatedBT, title={Segregated Binary Trees: Address-Ordered Binary Trees Revisited}, author={}, year={2000} }