Memory Allocation Costs in Large C and C+Programs内存分配成本大C和C++程序.pptVIP

Memory Allocation Costs in Large C and C++ Programs An article by David Detlefs, Al Dosser and Benjamin Zorn Presented by Vered Ojalvo Agenda Introduction Programs Used in the Tests Allocators Used in the Tests Overview of a Memory Allocator Test Results Summary Introduction Dynamic Storage Allocation Efficiency Importance Many Algorithms for DSA Exist Comparison Between Allocators is Needed How to Compare Allocators? Programs Drawn from Wide Variety of Application Areas Most are Publicly Available Used in Previous DSA Comparisons Programs (cont.) Programs (cont.) Allocation Information by Programs Allocators Several Allocators Tested Most are Public, One Commercially Available Each Implements a Different Allocation Algorithm Allocators - List of Allocators - List of (cont.) A Memory Allocator Introduction Goals Algorithm Implementation Considerations Memory Allocator - Introduction Written by Doug Lea Publicly Available Widely Used in Linux, embedded systems and PC environments Memory Allocator -Goals Balance Between a Number of Goals: Maximizing Compatibility Maximizing Portability Minimizing Space Memory Allocator -Goals (cont.) Minimizing Time Maximizing Locality Maximizing Error Detection Memory Allocator - Goal Discussion Some say (Paul Wilson and others in “Dynamic Storage Allocation: A Survey and Critical Review”) that the allocator’s primary goal is minimizing space by minimizing wastage. Memory Allocator - Goal Discussion (cont.) Doug Lea believes that while time/space issues dominate, the set of tradeoffs and compromises is nearly endless. Memory Allocator - Goal Discussion (cont.) For Example: Worst-case alignment increases wastage by forcing skips of bytes to align chunks Some methods that improve time/space for small programs may cause unacceptably worse time/space characteristics in large programs Memory Allocator - Algorithms Two core elements: Boundary Tags - Size Information Before and After the Chunk Binning - Available C