Two memory allocators that use hints to improve locality

Abstract

Dynamic memory allocators affect an application's performance through their data layout quality. They can use an application's allocation hints to improve the spatial locality of this layout. However, a practical approach needs to be automatic, without user intervention. In this paper we present two locality improving allocators, that use allocation hints provided automatically from the C++ STL library to improve an application's spatial locality. When compared to state-of-the-art allocators on seven real world applications, our allocators run on average 7% faster than the Lea allocator, and 17% faster than the FreeBSD's allocator, with the same memory fragmentation as the Lea allocator, one of the best allocators.While considering locality as an important goal, locality improving allocators must not abandon the existing constraints of fast allocation speed and low fragmentation. These constraints further challenge their design and implementation. We experimentally show that within a memory allocator, allocation speed, memory fragmentation, and spatial locality compete with each other in a game of rock, paper, scissors: when one tries to improve one trait, the others suffer. We conclude that our allocators achieve a good balance of these traits, and they can easily be adjusted to optimize the most important trait for each application.

Identifying the sources of cache misses in Java programs without relying on hardware counters

“…These techniques use a variety of types of static and dynamic information that can be obtained without special hardware, such as field access profiles at read barriers [7,8,9], object lifetimes [10], allocation frequencies for each Java class [11], hints provided by the STL container libraries [12], or static access patterns analyzed at the compilation time [13]. Our heuristic approach is unique in the sense that we try to detect objects and fields that cause many cache misses, not just those that are frequently accessed.…”

“…We use these special patterns to handle collection classes. Because it is known that the objects managed by a collection class, such as hashmaps, frequently cause cache misses and so these patterns are important when identifying likely cache misses [12]. The first pattern in Figure 6 includes a type cast.…”

Analyzing the impact of useless write-backs on the endurance and energy consumption of PCM main memory

“…Flushing the cache will actually write back the data, and invalidating it, while still avoiding the write-back, could have a negative impact on performance, because the benefits of temporal locality are lost. This is particularly true the for heap region where memory allocators are actually designed to improve cache locality by reusing recently freed blocks [22], [23], [24], [25], [26].…”

SmartApps: Middle-ware for Adaptive Applications on Reconfigurable Platforms

“…We have also developed several custom memory allocators: Defero [19] and TP [20]. The ultimate objective was to interface to K42'named paging system.…”