Affiliation:
1. Department of Computer Sciences, The University of Texas at Austin, Austin, Texas
2. Department of Computer Science, University of Massachusetts, Amherst, Massachusetts
Abstract
Parallel, multithreaded C and C++ programs such as web servers, database managers, news servers, and scientific applications are becoming increasingly prevalent. For these applications, the memory allocator is often a bottleneck that severely limits program performance and scalability on multiprocessor systems. Previous allocators suffer from problems that include poor performance and scalability, and heap organizations that introduce false sharing. Worse, many allocators exhibit a dramatic increase in memory consumption when confronted with a producer-consumer pattern of object allocation and freeing. This increase in memory consumption can range from a factor of
P
(the number of processors) to unbounded memory consumption.This paper introduces Hoard, a fast, highly scalable allocator that largely avoids false sharing and is memory efficient. Hoard is the first allocator to simultaneously solve the above problems. Hoard combines one global heap and per-processor heaps with a novel discipline that provably bounds memory consumption and has very low synchronization costs in the common case. Our results on eleven programs demonstrate that Hoard yields low average fragmentation and improves overall program performance over the standard Solaris allocator by up to a factor of 60 on 14 processors, and up to a factor of 18 over the next best allocator we tested.
Publisher
Association for Computing Machinery (ACM)
Reference29 articles.
1. U. Acar E. Berger R. Blumofe and D. Papadopoulos. Hood: A threads library for multiprogrammed multiprocessors. http://www.cs.utexas.edu/users/hood Sept. 1999. U. Acar E. Berger R. Blumofe and D. Papadopoulos. Hood: A threads library for multiprogrammed multiprocessors. http://www.cs.utexas.edu/users/hood Sept. 1999.
2. A hierarchical O(N log N) force-calculation algorithm
3. bCandid.com Inc. http://www.bcandid.com. bCandid.com Inc. http://www.bcandid.com.
4. Scheduling multithreaded computations by work stealing
Cited by
147 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. M‐DFCPP: A runtime library for multi‐machine dataflow computing;Concurrency and Computation: Practice and Experience;2024-08-07
2. BatchIt: Optimizing Message-Passing Allocators for Producer-Consumer Workloads: An Intellectual Abstract;Proceedings of the 2024 ACM SIGPLAN International Symposium on Memory Management;2024-06-20
3. RT-Mimalloc: A New Look at Dynamic Memory Allocation for Real-Time Systems;2024 IEEE 30th Real-Time and Embedded Technology and Applications Symposium (RTAS);2024-05-13
4. Defending the Heap: Diagnosing Undefined Behavior in Dynamic Memory with jkmalloc;2023 International Conference on Computational Science and Computational Intelligence (CSCI);2023-12-13
5. VCMalloc: A Virtually Contiguous Memory Allocator;IEEE Transactions on Computers;2023-12