A hybrid allocator

  • Authors:

  • Y. Hasan;J. Morris Chang

  • Affiliations:

  • Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA

  • Venue:
  • ISPASS '03 Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Dynamic memory management can make up to 30% of total program execution time. Object oriented languages like C++ allocate and free dynamic memory prolifically. Since computer memory is a limited resource its efficient utilization is required to minimize wastage and keep costs down. Memory management algorithms such as best fit seem to perform most efficiently in terms of space cost while simple segregated storage seems to minimize the time cost. There is a trade-off between time and space costs. We have developed a new general purpose hybrid algorithm that shows excellent performance with respect to both time and space in comparison to the Doug Lea version 2.7.0 dynamic memory allocator.