A high performance memory allocator for object-oriented systems

DOI10.1109/12.485574MaRDI QIDQ4420934zbMATH OpenOpenAlexFDO

Authors J. Morris Chang, Edward F. Gehringer

Publication date 1996

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.485574

zbMATH Keywords

buddy systemObject-orientend programming languages

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Fast allocation and deallocation with an improved buddy system
• Buddy Algorithms
• Efficient algorithms for dynamic allocation of distributed memory
• Worst case performance analysis of the two dimensional binary buddy system^∗
• Worst case performance of weighted buddy systems

Cited in

(7)

• Worst case performance of weighted buddy systems
• An integrated dynamic memory tracing tool for C++
• A study of dynamic memory management in C++ programs.
• Implementing heap-object behavior prediction efficiently and effectively
• Buddy Algorithms
• An Overview of Object-Oriented Simulation
• Experience with an efficient parallel kernel memory allocator

This page was built for publication: A high performance memory allocator for object-oriented systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420934)