z-logo
Premium
Memory allocation costs in large C and C++ programs
Author(s) -
Detlefs David,
Dosser Al,
Zorn Benjamin
Publication year - 1994
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380240602
Subject(s) - allocator , c dynamic memory allocation , computer science , garbage collection , implementation , the internet , dynamic data , resource allocation , garbage , manual memory management , computer data storage , distributed computing , database , memory management , computer network , operating system , programming language , overlay
Abstract Dynamic storage allocation is an important part of a large class of computer programs written in C and C + +. High‐performance algorithms for dynamic storage allocation have been, and will continue to be, of considerable interest. This paper presents detailed measurements of the cost of dynamic storage allocation in 11 diverse C and C + + programs using five very different dynamic storage allocation implementations, including a conservative garbage collection algorithm. Four of the allocator implementations measured are publicly available on the Internet. A number of the programs used in these measurements are also available on the Internet to facilitate further research in dynamic storage allocation. Finally, the data presented in this paper is an abbreviated version of more extensive statistics that are also publicly available on the Internet.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here